Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // FIBONACCI RECURSION O(2^N)
- function fibonacciRecursion(num) {
- if (num <= 1) return 1;
- return fibonacci(num - 1) + fibonacci(num - 2);
- }
- // FIBONACCI LOOP O(N)
- function fibonacciLoop(n) {
- let a = 1, b = 0, temp;
- while (num >= 0){
- temp = a;
- a = a + b;
- b = temp;
- num -= 1;
- }
- return b;
- }
- // FIBONACCI MEMO O(N)
- function fibonacciMemo(num, memo) {
- memo = memo || {};
- if (memo[num]) return memo[num];
- if (num <= 1) return 1;
- return memo[num] = fibonacci(num - 1, memo) + fibonacci(num - 2, memo);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement