Recursive Functions

This lesson will teach us how to implement recursion in ReasonML.

We'll cover the following

Definition

Recursion is the process in which a function calls itself during runtime. It stops at the base case. The base case is a check which specifies the final level of recursion.

We can think of recursion as boxes within boxes, with each recursive call being a box. Recursion grows in a nested manner, and always reduces back to the original call.

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy