performance: iterate only through odd numbers in is_prime function

10001st_prime.rs

@@ -1,12 +1,19 @@
 fn is_prime(num: u64) -> bool {
     let prime: bool = true;
-    for i in 2..=((num as f64).sqrt() as u64) {
+    match num {
+        0..=1 => false,
+        2 => true,
+        num if num % 2 == 0 => false,
+        _ => {
+            for i in (3..=((num as f64).sqrt() as u64)).step_by(2) {
                 if num % i == 0 {
                     return false;
                 }
             }
             prime
         }
+    }
+}
 
 fn main() {
     let mut primes: Vec<u64> = vec![];
@@ -19,5 +26,5 @@ fn main() {
         increment += 1;
     }
 
-    println!("{:?}", primes);
+    println!("{:?}", primes[primes.len()-1]);
 }