RUST Recursive Function

The final form of loop to consider is known as a recursive function. This is a function that calls itself until a condition is met.

Example RUST Recursive Function

Below is an Example of Factorial RUST recursive function.

fn factorial(num: u64) -> u64 {
    match num {
        0 | 1 => 1,
        _ => factorial(num - 1) * num,
    }
}

fn main() {
    println!("{}", factorial(10));
}

Output

3628800

Conclusion

In this page (written and validated by A. Gawali) you learned about Rust Recursive Function . What's Next? If you are interested in completing Rust tutorial, your next topic will be learning about: Rust Array.

Incorrect info or code snippet? We take very seriously the accuracy of the information provided on our website. We also make sure to test all snippets and examples provided for each section. If you find any incorrect information, please send us an email about the issue: mockstacks@gmail.com.

Share On:

Mockstacks was launched to help beginners learn programming languages; the site is optimized with no Ads as, Ads might slow down the performance. We also don't track any personal information; we also don't collect any kind of data unless the user provided us a corrected information. Almost all examples have been tested. Tutorials, references, and examples are constantly reviewed to avoid errors, but we cannot warrant full correctness of all content. By using Mockstacks.com, you agree to have read and accepted our terms of use, cookies and privacy policy.