0
2.1kviews
Explain recursion concept. Write a program to display Fibonacci series using recursion.
1 Answer
| written 9.3 years ago by |
Recursive Function:
A function that calls itself is called as recursive function.
A recursive function must definitely have a condition that exists from calling the function again.
Hence there must be a condition that calls the function itself if that condition is true.
If the condition is false then it …