Files
hello-algo/en/codes/rust/chapter_computational_complexity/complexity_exercises.rs
Yudong Jin 14c314c08c Retranslate the complete English edition from Simplified Chinese (#2010)
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
2026-10-31 03:35:51 +08:00

62 lines
1.1 KiB
Rust

/*
* File: complexity_exercises.rs
* Created Time: 2026-08-18
* Author: Hello Algo Team
*/
/* Sum using iteration */
fn sum_iter(n: i32) -> i32 {
let mut res = 0;
for i in 1..=n {
res += i;
}
res
}
/* Sum using recursion */
fn sum_recur(n: i32) -> i32 {
if n == 1 {
return 1;
}
n + sum_recur(n - 1)
}
/* Linear-time loop */
fn linear_loop(n: i32) -> i32 {
let mut res = 0;
for i in 0..n {
res += i;
}
res
}
/* Quadratic-time loop */
fn quadratic_loop(n: i32) -> i32 {
let mut res = 0;
for i in 0..n {
for j in i..n {
res += j;
}
}
res
}
/* Logarithmic-time loop */
fn logarithmic_loop(mut n: i32) -> i32 {
while n > 1 {
n /= 2;
}
n
}
fn main() {
assert_eq!(sum_iter(1), 1);
assert_eq!(sum_recur(1), 1);
assert_eq!(sum_iter(4), 10);
assert_eq!(sum_recur(4), 10);
assert_eq!(linear_loop(4), 6);
assert_eq!(quadratic_loop(4), 20);
assert_eq!(logarithmic_loop(4), 1);
assert_eq!(logarithmic_loop(5), 1);
}