Recursive algorithm targets a problem by dividing it into smaller, manageable sub-problems. The output of one recursion after processing one sub-problem becomes the input to the next recursive process.

A recursive algorithm is an **algorithm which calls itself with “smaller (or simpler)” input values**, and which obtains the result for the current input by applying simple operations to the returned value for the smaller (or simpler) input.

Recursive algorithm is a method of simplification that divides the problem into sub-problems of the same nature. The result of one recursion is the input for the next recursion. The repletion is in the self-similar fashion. **Generation of factorial, Fibonacci number series** are the examples of recursive algorithms.