Recursion is a powerful programming technique. A function that calls itself recursively not only saves programming effort and avoids repetition but it can also be used to navigate complex structures such as Trees and Class Hierarchies. But recursion can also be quite hard to understand.
I recently published a course that explains recursion from the ground up. The full price is $45. But if you use the link below you can sign up for just $12! (Local taxes or EU VAT may be applied)
I’ve tried to explain recursion in depth in this course. Along the way, I also explain some important details of the computer architecture. You need to understand the stack, stack frames, variable scope and a few other details in order to get a good understanding of recursion.
This is what you will learn…
- What is recursion?
- How variables are scoped in recursive functions
- How recursive functions return values
- The Stack and Stack Frames
- Debugging recursive functions
- Recursion v Iteration
- Stack Corruption, and how to avoid it
- Infinite Recursion, and how to avoid it
- Recursing Fibonacci Numbers
- Recursing a Class Hierarchy
- Trees and recursion
- Navigating subdirectories recursively
Sign up before the end of October 2018 to get this course at a 73% Discount...