Question

How to sum all the prime numbers in an array with Rust

Answer 1

fn is_prime(n: i32) -> i32 {
    if n == 0 || n == 1 {
        return 0;
    }

    for i in 2..=((n as f64).sqrt() as i32) {
        if n % i == 0 {
            return 0;
        }
    }

    return 1;
}

fn main() {
    let arr = vec![9, 8, 17, 5, 19, 22, 21, 13, 38, 500, 99];
    let mut sum_prime = 0;

    for &num in &arr {
        if is_prime(num) != 0 { // 19 17 5 13
            sum_prime += num;
        }
    }

    println!("{}", sum_prime);
}



      
/*
run:
  
54
 
*/
 

 

70+ SQL courses for beginners and professionals