Recursion
Recursion:
recursion means function calling it self. when function call it self in function definition it called as recursion.
example of recursive function:
- factorial of number
- Fibonacci series
- marge and quick sort
And many more...
lets understand recursion with example:
To understand recursion well lets understand first about stack
stack: stack is used to store value and for that stack follows certain rules as LIFO or FILO mean whatever last value is stored it give that value fist ( last in first out) and value that stored first it given at last( first in first out ) both are same in logic way.
Don't worry if you face any problem to understand stack it become more clear when we refer examples.