Recursive functions are functions that call themselves in their definition, enabling the function to repeat its behavior until a base condition (also known as a stopping condition) is satisfied. This technique is particularly useful for solving problems that can be broken down into smaller, similar subproblems.

Recursive functions leverage the divide and conquer strategy where a problem is divided into smaller chunks, each chunk is solved individually, and the individual results are combined to form the final result