mdelvalle / cs371p-collatz Goto Github PK

Created at least 3 Unit tests for each of the functions.

Used Doxygen to document the project.

Made it work with 1,000,000 entries.

Changed the boolean variable 'hit' to become false after being true, then it worked!

Implemented all of the requirements and the project runs as expected.

Changed from:
n = (3 * n) + 1;
to:
n = n + (n >> 1) + 1;

Counting this one, there is a total of 18 issues.

Sphere accepted solutions to both the required and extra-credit solutions.

Updated code to see if i is more than j; if it is, swap them.

Made it dramatically faster by adding:
Let m = e / 2.
If b < m, then max_cycle_length(b, e) = max_cycle_length(m, e)

Used Python script to create the 1000 Acceptance tests.
Pushed the tests to the public test repository.

Was not passing another user's test case; got it resolved.

Had:
int idx = 1000000;
int cache[idx] = {0};
This is what gave me the error; these were both global variables used inside the function collatz_eval.

After, I changed the code to:
int cache[1000000] = {0};
with no index variable, the algorithm worked without problems.

Was getting more than 1 million memory errors because I was creating an array of 1 million entries every time the function collatz_eval was called.
Instead I made the array a global variable; it solved the problem and increased the efficiency dramatically.

Finished with the project; sphere accepts both solutions.

Created a new private repository for the Collatz project.

Implemented a lazy cache.

Submitted collatz-project.