Recursion
This lesson will get you acquainted with recursion in Rust.
We'll cover the following
What Is Recursion?
Recursion is a method of function calling in which a function calls itself during execution.
There are problems which are naturally recursively defined. For instance, the factorial of a number $n$ is defined as n times the factorial of $n1$.
factorial(n) = n * factorial(n1)
Parts of Recursion
In terms of programming, a recursive function must comprise two parts:

Base case
A recursive function must contain a base case. This is a condition for the termination of execution.

Recursive case
The function keeps calling itself again and again until the base case is reached.
Example
The following example computes the factorial of a number using recursion:
Note: A factorial is defined only for nonnegative integer numbers.
Create a free account to access the full course.
By signing up, you agree to Educative's Terms of Service and Privacy Policy