In a computer program, when a function calls itself then it is called:

Recursion: Recursion is a programming technique in which a function calls itself to solve a problem by breaking it into smaller subproblems. Key requirement: each recursive function must have a base case to terminate the recursion; without it, the recursion can become infinite and may cause a stack overflow.