We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Recursion: Fibonacci Numbers
- Discussions
Recursion: Fibonacci Numbers
Recursion: Fibonacci Numbers
+ 0 comments php
function fibonacci($n, $result = [0,1]) { if (isset($result[$n])) { return $result[$n]; } $length = count($result); $result[] = $result[$length - 1] + $result[$length - 2]; return fibonacci($n, $result); }
+ 0 comments O(N) time and O(N) space dynamic solution.
def fibonacci(n,dp): if dp[n]!=-1: return dp[n] dp[n] = fibonacci(n-1,dp)+fibonacci(n-2,dp) return dp[n] n = int(input()) dp = [-1]*(n+1) dp[0] = 0 dp[1] = 1 print(fibonacci(n,dp))
+ 0 comments def fibonacci(n):
p = 0 c = 1 for i in range(1,n): k = c c = p+c p = k return c
+ 0 comments def fibonacci(n): if n == 1 or n == 2: return 1 elif n > 2: return fibonacci(n-1) + fibonacci(n-2) n = int(input()) print(fibonacci(n))
+ 0 comments c language (easy)
include
int fibo(int num) { if(num==0||num==1) return num; else return fibo(num-1)+fibo(num-2);
} int main() { int n; scanf("%d",&n); printf("%d",fibo(n)); return 0; }
Load more conversations
Sort 287 Discussions, By:
Please Login in order to post a comment