Recursive Functions

Recursive Functions

• A function that calls itself is known as Recursive Function. 

• Factorial(n) = n*factorial(n-1) 

 

Advantages of Python Recursion:

• We can reduce length of the code and improves readability.

• We can solve complex problems very easily. 

• Algorithms can be defined recursively making it much easier to visualize and prove.

Disadvantages of Python Recursion 

• Slow.

• Logical but difficult to trace and debug.

• Requires extra storage space. For every recursive calls separate memory is allocated for the variables.