어떤 절차나 정의 속에 자기 자신을 다시 참조하거나 포함하여 문제를 해결하거나 정의하는 방식.
The process of defining a function, procedure, or rule in terms of itself, typically to solve complex problems by breaking them down into smaller, similar sub-problems.
예문:
"The programmer used recursion to traverse the complex tree structure of the file system."
"A classic example of recursion in mathematics is the Fibonacci sequence, where each number is the sum of the two preceding ones."
"Without a proper exit condition, recursion can lead to a stack overflow error."