A recursive function is a function that elegantly solves problems by calling itself. It breaks complex tasks into simpler, self-similar instances, halting when a base case is met. See also Algorithm Stack Iteration Divide and Conquer