Recursion and Recursive Functions in C++. Recursive function is a function that calls itself. Every recursive function needs a base case to determine when the recursion should end. With every recursive call we add to the call stack, we pass in a new parameter that reaches towards the base case. This is called the recursive step. Without a base case, there would be a stack overflow. In this video, we will go over how recursion works on in memory.
If you need to review these topics:
Functions: https://youtu.be/65PSQUdH5k0
Pass by Value vs Reference: https://youtu.be/77XcoXwoK2c
Function Overloading: https://youtu.be/tJPHWF1PboY
Const Reference: https://youtu.be/aP_VwBrPrJw
Templates and Generics: https://youtu.be/8IgXzTNgQdo
C++ Playlist:
https://www.youtube.com/playlist?list=PLnKe36F30Y4ZDNIOZ51sX25pWKQ1pkpTE
Github Repo for C++ Code:
https://github.com/ImKennyYip/cpp
Install C++ with VS Code:
https://youtu.be/DMWD7wfhgNY
Subscribe for more coding tutorials 😄!
⭐ If you enjoyed the tutorial and would like to support the channel, you can do so here 💖: https://buymeacoffee.com/kennyyipcoding
