search

trekhleb / javascript-algorithms

📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings
MIT License
185.03k stars 29.84k forks source link

Added a recursive code for finding the fibonacci series #1062

Open Shashi3k opened 10 months ago

Shashi3k commented 10 months ago

Hey, I added a recursive code for the fibonacci problem. Hope you merge it

nihongeakira commented 9 months ago

def fibonacci(n): if n <= 1: return n else: return fibonacci(n-1) + fibonacci(n-2) You can use this function to get the nth Fibonacci number by calling fibonacci(n). However, keep in mind that this recursive approach has exponential time complexity. For large values of n, it will be slow. There are more efficient ways to compute Fibonacci numbers, such as using iterative methods or memoization.

If you'd like more information or improvements to the code, please let me know!