What is the name of a function that calls itself during its execution?

The function that calls itself during its execution is referred to as recursion. This programming concept allows a function to solve a problem by breaking it down into smaller instances of the same problem, effectively calling itself to perform the task. Recursion typically involves a base case, which stops the function from calling itself indefinitely, and a recursive case, which is where the function calls itself with modified arguments to approach the base case.

In practical terms, recursion is useful for tasks such as traversing data structures (like trees), solving mathematical problems (like calculating factorials), or implementing algorithms (like quicksort). By defining a problem in terms of smaller sub-problems, recursion can lead to elegant and simplified code solutions, making it a powerful tool in programming.

This understanding is key in computer science as recursion often provides a clear and concise way to solve complex problems through repeated self-references.