A classic example of recursion is the factorial function: n! = n * (n-1)! If n is 1, the function returns 1 (base case). Otherwise, it calls itself with n-1 until it reaches the base case. The results are combined to calculate the final factorial.