mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +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>
36 lines
725 B
JavaScript
36 lines
725 B
JavaScript
/**
|
|
* @function fibonacciCache
|
|
* @description - this is a cached variant of fib number
|
|
* @param {number} n - Real number (n > -1)
|
|
* @param {Object} cache
|
|
* @returns {number}
|
|
*/
|
|
export const fibonacciCache = (n, cache = null) => {
|
|
if (cache) {
|
|
const value = cache.get(n)
|
|
|
|
if (value !== null) {
|
|
return value
|
|
}
|
|
}
|
|
|
|
if (n === 1 || n === 2) {
|
|
return 1
|
|
}
|
|
|
|
const result = fibonacciCache(n - 1, cache) + fibonacciCache(n - 2, cache)
|
|
|
|
cache && cache.set(n, result)
|
|
|
|
return result
|
|
}
|
|
|
|
/**
|
|
* @title implementation of union function
|
|
* @param {Set} sets
|
|
* @return {new Set}
|
|
*/
|
|
export const union = (...sets) => {
|
|
return new Set(sets.reduce((flatArray, set) => [...flatArray, ...set], []))
|
|
}
|