In this video, we are going to learn about recursion – what recursion is, how it works, and why it’s useful.
This video is part of a series – you’ll get a lot more out of it if you watch the other episodes before watching this one. You can find them here:
Recursion is when a function calls itself until it doesn’t.
That is seriously all recursion is. It’s really simple. A lot of people think that recursion is hard. The reason people think that recursion is hard is because all explanations of recursion use fibonacci numbers as an example, which is the worst example ever. If somebody tries to explain recursion to you using fibonnaci numbers, you must murder them. I understand that sounds rough, because they mean well, but
we really need to get rid of that, because it makes everyone think that recursion is hard, when it is actually easy.