Skip to content

Instantly share code, notes, and snippets.

@maksbd19

maksbd19/fibonacci-call-stack

Last active July 21, 2019 11:43
Show Gist options
  • Save maksbd19/9b1f80eeb1d43ddbe21a17d7959fd73b to your computer and use it in GitHub Desktop.
Save maksbd19/9b1f80eeb1d43ddbe21a17d7959fd73b to your computer and use it in GitHub Desktop.
Download ZIP
Raw
fibonacci-call-stack
8 <-- fibonacci(5); <---------------------------- first call to get the 5th element of Fibonacci series
5 <-- fibonacci(5-1); <-------------------- recursive call to fibonacci(4)
3 <-- fibonacci(4-1); <-------------- recursive call to fibonacci(3)
2 <-- fibonacci(3-1); <-------- recursive call to fibonacci(2);
1 <-- fibonacci(2-1); <--- recursive call to fibonacci(1); base case: return `1` immediately
1 <-- fibonacci(2-2); <--- recursive call to fibonacci(0); base case: return `1` immediately
1 <-- fibonacci(3-2); <-------- recursive call to fibonacci(1); base case: return `1` immediately
2 <-- fibonacci(4-2); <-------------- recursive call to fibonacci(2)
1 <-- fibonacci(2-1); <-------- recursive call to fibonacci(1); base case: return `1` immediately
1 <-- fibonacci(2-2); <-------- recursive call to fibonacci(0); base case: return `1` immediately
3 <-- fibonacci(5-2); <-------------------- recursive call to fibonacci(3)
2 <-- fibonacci(3-1); <-------------- recursive call to fibonacci(2);
1 <-- fibonacci(2-1); <--------- recursive call to fibonacci(1); base case: return `1` immediately
1 <-- fibonacci(2-2); <--------- recursive call to fibonacci(0); base case: return `1` immediately
1 <-- fibonacci(3-2); <-------------- recursive call to fibonacci(1); base case: return `1` immediately
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment