Which of the following best describes 'recursion' in programming?
A
A type of variable declaration
B
A method of sorting arrays
C
A function calling itself to solve a smaller instance of a problem
D
A loop that never terminates
Correct Answer: Option C — A function calling itself to solve a smaller instance of a problem
Explanation:
Recursion is a programming technique where a function calls itself to solve a smaller instance of the same problem, continuing until a base condition is reached. It is commonly used for tasks like tree traversal and calculating factorials.