Method CRCAlgorithm::divideMessageWithP

[samuelsoder]

The implementation of the Cyclic Redundancy Check algorithm in src/main/java/com/thealgorithms/others/CRCAlgorithm.java has reported cyclomatic complexity 18 by lizard.

Part 1 steps:

• [ ] Manual calculation of cyclomatic complexity @kaggenius
• [ ] Manual calculation of cyclomatic complexity @granhall

Part 2 steps:

• [ ] Instrument code coverage manually (in a new branch called something like issue<No>/manual-instrument)
• [ ] Save the result of manual and automatic instrumentation, either in this issue by screenshot or in the branch and link to it.
• [ ] Add tests to improve code coverage (on a different branch than before, called something like issue<No>/increase-coverage). Assignment PDF gives more detailed steps on what steps should be taken to identify types of tests to add etc.
• [ ] Create a plan or draft for refactoring the function. A clear description is required to pass the assignment.

[tjog]

Previous branch coverage was 0% with no test files or main driver. The commit https://github.com/DD2480-2022-group-7/Java/commit/20e2b1ecec424a6f01c19b1fbd1bd956c222c84f bumps this to 88% by adding two tests.

Coverage report by JaCoCo after commit https://github.com/DD2480-2022-group-7/Java/commit/20e2b1ecec424a6f01c19b1fbd1bd956c222c84f :

Class overview of CRCAlgorithm


Method divideMessageWithP