Implemented Collatz Sequence

[RohanK6]

Describe your change:

The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined as follows: start with any positive integer n. Then each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.

• Add an algorithm?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Java files are placed inside an existing directory.
• All filenames are in all uppercase characters with no spaces or dashes.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.