The function calls itself until someone stops it. Recursion can feel difficult to new developers. Perhaps that's because many resources teach it using algorithmic examples (Fibonacci, linked-lists). This piece will hopefully introduce things plainly, using one simple example. Recursion is when a function calls itself until someone stops it.