mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* 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>
25 lines
914 B
JavaScript
25 lines
914 B
JavaScript
/*
|
|
* Juggler Sequence: https://en.wikipedia.org/wiki/Juggler_sequence
|
|
* function jugglerSequence
|
|
* Juggler Sequence is a series of integer number in which the first term starts with a positive integer number n
|
|
* and the remaining terms are generated from the immediate previous term using the recurrence relation
|
|
* Produce Juggler Sequence using number n as the first term of the sequence and store in an array
|
|
* Reference: https://www.geeksforgeeks.org/juggler-sequence/
|
|
* jugglerSequence(3) // returns [3, 5, 11, 36, 6, 2, 1 ]
|
|
* jugglerSequence(9) // returns [9, 27, 140, 11, 36, 6, 2, 1]
|
|
* jugglerSequence(15) // returns [15, 58, 7, 18, 4, 2, 1]
|
|
*/
|
|
|
|
function jugglerSequence(n) {
|
|
const sequence = []
|
|
sequence.push(n)
|
|
// Calculate terms until last term is not 1
|
|
while (n !== 1) {
|
|
n = Math.floor(n ** ((n % 2) + 0.5))
|
|
sequence.push(n)
|
|
}
|
|
return sequence
|
|
}
|
|
|
|
export { jugglerSequence }
|