recursive function
A "recursive function" is a powerful concept used in both computing and mathematics to solve problems by breaking them down into smaller, more manageable sub-problems.
🇺🇸 US Voice:
🇬🇧 UK Voice:
Definition
C1Computing
(technical)A function that calls itself during its execution until a specific condition is met.
Example
- The factorial function is a classic example of a recursive function in programming.
C1Mathematics
(technical, academic)A function whose value is obtained through a finite number of operations defined by a precise algorithm, often involving the function itself.
Example
- The Fibonacci sequence can be generated using a recursive function.
Similar
Terms that have similar or relatively close meanings to "recursive function":