Primality Test v1 with Rust (School Method)

is_prime.rs

// Time complexity of this solution is O(√n)

fn is_prime(n : i32) -> bool {
    if n <= 1 {
        return false;
    }
    
    for i in 2..n-1{
        if n%i == 0 {
            return false;
        }
    }
    
    return true;
}

fn main() {
    let n = 3003;
    println!("Number {} is prime? {}", n, is_prime(3003));
}