summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
907db2c)
Signed-off-by: Jérôme Benoit <jerome.benoit@sap.com>
* @returns
*/
function fibonacciLoop (num) {
* @returns
*/
function fibonacciLoop (num) {
- let a = 1
- let b = 0
- let temp
-
- while (num >= 0) {
- temp = a
- a = a + b
- b = temp
- num--
+ const fib = []
+ fib[0] = 0
+ fib[1] = 1
+ for (let i = 2; i <= num; i++) {
+ fib[i] = fib[i - 2] + fib[i - 1]
* @returns
*/
function fibonacciRecursion (num) {
* @returns
*/
function fibonacciRecursion (num) {
- if (num <= 1) return 1
-
+ if (num <= 1) return num
return fibonacciRecursion(num - 1) + fibonacciRecursion(num - 2)
}
return fibonacciRecursion(num - 1) + fibonacciRecursion(num - 2)
}
memo = memo || {}
if (memo[num]) return memo[num]
memo = memo || {}
if (memo[num]) return memo[num]
+ if (num <= 1) return num
return (memo[num] =
fibonacciRecursionMemoization(num - 1, memo) +
return (memo[num] =
fibonacciRecursionMemoization(num - 1, memo) +