Recursion is a concept that is best understood through visualization. In this video, you will see visualization for different kinds of recursions. For simplicity, I chose to animate recursive functions using trees. Properties of the recursion tree visualizations are:
* Each node represents a single recursive function call.
* The height of the recursion tree is the depth of our function call stack.
* The rate of change of the tree's width represents the time complexity of our function.
If you want to see the visualizations, dive right in.
Outline of this video:
* 0:00 - Intro
* 0:29 - Recursive Power Function Visualization
* 1:08 - Recursive Fibonacci Calculation Visualization
* 2:23 - Recursive Fibonacci-like Sequence Calculation Visualization
* 2:38 - Conclusion
* 3:22 - Slow-mo Fibonacci 10 Visualization
* 5:45 - Outro
Recursion visualization tool used in this video:
* quanticdev.com/tools/recursion-visualization
If you want to read or contribute, you can find this guide on:
* quanticdev.com/algorithms/primitives/recursion-visualization
My "Staircase Problem + 3 Variants" video, which is a great real-world application of recursive solutions, as well as memoization and plain iteration:
* kzread.info/dash/bejne/o4d5lMuEgriahaQ.html
My Algorithms Playlist:
* kzread.info/head/PLlPRnMzqjADqDZFBqdwzbIjf71h8xYs4x
- - - - - - - - - - -
quanticdev
quantic_dev
quanticdev.com