A recursive function is one that calls itself with a smaller version of the problem until it reaches a known answer (the base case). Recursion shines when a problem's structure mirrors itself — like a ...