jarjar/rustlings
1
0
Fork 0
mirror of https://github.com/rust-lang/rustlings.git synced 2025-12-28 06:49:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add a method that solves the problem: using recursion combined with match to implement factorial.

Browse Source
This commit is contained in:
1vk3y 2024-10-19 18:35:47 +08:00
parent 930a0ea73b
commit 04407ae27e
1 changed files with 13 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
solutions/18_iterators/iterators4.rs
View File

@ -1,4 +1,4 @@
// 3 possible solutions are presented.
// 4 possible solutions are presented.
// With `for` loop and a mutable variable.
fn factorial_for(num: u64) -> u64 {
@ -35,6 +35,14 @@ fn factorial_product(num: u64) -> u64 {
(2..=num).product()
}
// Using recursion in conjunction with the `match` to implement factorial
fn factorial_recursion(num: u64) -> u64 {
match num {
0..=1 => 1,
_ => num * factorial_recursion(num - 1),
}
}
fn main() {
// You can optionally experiment here.
}
@ -48,6 +56,7 @@ mod tests {
assert_eq!(factorial_for(0), 1);
assert_eq!(factorial_fold(0), 1);
assert_eq!(factorial_product(0), 1);
assert_eq!(factorial_recursion(0), 1);
}
#[test]
@ -55,12 +64,14 @@ mod tests {
assert_eq!(factorial_for(1), 1);
assert_eq!(factorial_fold(1), 1);
assert_eq!(factorial_product(1), 1);
assert_eq!(factorial_recursion(1), 1);
}
#[test]
fn factorial_of_2() {
assert_eq!(factorial_for(2), 2);
assert_eq!(factorial_fold(2), 2);
assert_eq!(factorial_product(2), 2);
assert_eq!(factorial_recursion(2), 2);
}
#[test]
@ -68,5 +79,6 @@ mod tests {
assert_eq!(factorial_for(4), 24);
assert_eq!(factorial_fold(4), 24);
assert_eq!(factorial_product(4), 24);
assert_eq!(factorial_recursion(4), 24);
}
}