Updated 1 solution

Author: RodneyShag

Chp. 06 - Math and Logic Puzzles/__Intro_Prime/Prime.java

@@ -24,28 +24,22 @@ public static boolean isPrime(int n) {
     /* Solution 2: Sieve of Eratosthenes */
     public static boolean[] generatePrimes(int max) {
         boolean[] flags = new boolean[max + 1];
-        initialize(flags);
+        for (int i = 2; i < flags.length; i++) {
+            flags[i] = true;
+        }
+
         int prime = 2;
         int sqrt = (int) Math.sqrt(max);
         while (prime <= sqrt) { // see comment in crossOff() to see why we stop at sqrt(max)
-            crossOff(flags, prime);
+            crossOffMultiplesOfPrime(flags, prime);
             prime = getNextPrime(flags, prime);
         }
         return flags;
     }
 
-    private static void initialize(boolean[] flags) {
-        flags[0] = false;
-        flags[1] = false;
-        for (int i = 2; i < flags.length; i++) {
-            flags[i] = true;
-        }
-    }
-
-    /* Cross off multiples of prime from our array */
-    private static void crossOff(boolean[] flags, int prime) {
-        /* We can start with (prime*prime), because if we have k * prime, where k < prime,
-           this value would have already been crossed off in a prior call to this function */
+    private static void crossOffMultiplesOfPrime(boolean[] flags, int prime) {
+        // We can start with (prime*prime), because if we have k * prime, where k < prime,
+        // this value would have already been crossed off in a prior call to this function
         for (int i = prime * prime; i < flags.length; i += prime) {
             flags[i] = false;
         }