Reverse Thinking in Recursion | Chapter 1, Essence of Recursion

Recursion is commonly used in computer programming. It refers to the method of defining functions that call themselves. Recursion can decompose a complex problem into smaller sub-problems. However, in practice, the design of recursive functions is often very tricky, because a recursive function would keep calling itself. This kind of nesting can be very confusing sometimes.
In this series of videos, we will gradually dig into the essence of recursion, and find an intuitive and general method to solve most recursive problems...

#recursion #factorial #fibonacci #mergesort #towerofhanoi #algorithm #computerscience

[atairakhmatov]

Leaving this commment before Terry's channel blows up

[hmmmza]

A great channel indeed... Good luck for the future mate! :)

[yashwanth]

to understand recursion you should first understand recursion