mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00

* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
31 lines
844 B
JavaScript
31 lines
844 B
JavaScript
/**
|
|
* @function collatz
|
|
* @description Applies the Collatz Sequence on a specified number.
|
|
* The Collatz Sequence states that every natural number will always fall in a 1, 2, 4 loop when iterated under the following function:
|
|
* If the number is even, divide by 2, and if its odd, multiply it by 3 and add 1.
|
|
*
|
|
* @parama {Integer} n The number to apply the Collatz Sequence to.
|
|
*
|
|
* @return An array of steps and the final result..
|
|
*
|
|
* @see [Collatz Conjecture](https://en.wikipedia.org/wiki/Collatz_conjecture)
|
|
*
|
|
* @example collatz(1) = { result: 1, steps: [] }
|
|
* @example collatz(5) = { result: 1, steps: [16, 8, 4, 2, 1] }
|
|
*/
|
|
export function collatz(n) {
|
|
const steps = []
|
|
|
|
while (n !== 1) {
|
|
if (n % 2 === 0) {
|
|
n = n / 2
|
|
} else {
|
|
n = 3 * n + 1
|
|
}
|
|
|
|
steps.push(n)
|
|
}
|
|
|
|
return { result: n, steps }
|
|
}
|