Rust Exercise

nth_prime.rs

pub fn check_for_prime(div: u32, primes: &mut Vec<u32>) -> bool {
    for i in primes {
        if *i > div/2 {
            return true;
        }

        if div % *i == 0 {
            return false;
        }
    }
    return true;
}


pub fn nth(n: u32) -> u32 {
    let mut div = 2;
    let mut primes: Vec<u32> = Vec::new();
    let mut counter = 0;

    loop {
        match check_for_prime(div, &mut primes) {
            true => {
                primes.push(div);
                counter += 1;
                if counter == n + 1 {
                    return div;
                }
            },
            false => (),
        };

        if div % 2 == 0 {
            div += 1;
        } else {
            div += 2;
        }
    }
}