A programming technique where functions call themselves to solve problems by breaking them into smaller versions of the same problem. Recursion requires a base case to terminate recursion and a recursive case that calls the function with modified parameters. Recursion naturally suits problems with recursive structure like tree traversal or factorial calculation. Understanding recursion is essential for advanced algorithms.