I am not able to understand recursions

[nhcarrigan]

Hey there~!

I’m going to link to a post I made on another topic that includes a breakdown of how recursion works - let me know if this helps.

Help please! Replace Loops using Recursion

Hello~! Let me see if I can help explain it. First, the return 0 portion is the “base case”. A recursive function needs to have a base case, or it will continue on for infinity (or until the browser crashes). In order to understand recursion, we need to understand the call stack. As each function call gets generated, it is added to the stack. When the function calls end (because the base case is reached), the stack begins resolving. This happens in a “First-In-Last-Out” basis, or in the revers…