**13.2 Simple recursive algorithm**

A recursive (self-executing) algorithm is one that uses smaller input values and applies simple operations to them in order to obtain the result. It applies the principle of solving a problem by dividing it into smaller versions, which can then be solved by the use of recursive algorithms. If a function is represented recursively, the corresponding recursive algorithm for the computation of its members is a mirror of the definition.
