A recursive function is defined using values of the same function on smaller inputs together with a base case.
What Is Recursive Function?
A recursive function is defined using values of the same function on smaller inputs together with a base case.
Examples of Recursive Function
1
Factorial can be defined by n! = n(n−1)! with 0! = 1.Formula and Key Points
Formula / rule
f(n)=…f(n−1)…
- Know the definition and standard notation for Recursive Function.
- Be able to recognise or compute recursive function in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used to model input-output behaviour in programs, APIs, algorithms, transformations and machine-learning pipelines.
Related Math Terms
Recursive Function: Frequently Asked Questions
What is Recursive Function?
A recursive function is defined using values of the same function on smaller inputs together with a base case.
Why is Recursive Function useful in computer science?
Used to model input-output behaviour in programs, APIs, algorithms, transformations and machine-learning pipelines.