read through ch12

ChrisMayfield · ChrisMayfield · commit 353123ff8249 · 2016-03-10T16:15:06.000-05:00
diff --git a/ch12/Search.java b/ch12/Search.java
@@ -24,14 +24,14 @@ public static int binarySearch(Card[] cards, Card target) {
         while (low <= high) {
             System.out.println(low + ", " + high);
 
-            int mid = (low + high) / 2;                   // step 1
+            int mid = (low + high) / 2;                      // step 1
             int comp = cards[mid].compareTo(target);
 
-            if (comp == 0) {                              // step 2
+            if (comp == 0) {                                 // step 2
                 return mid;
-            } else if (comp < 0) {                        // step 3
+            } else if (comp < 0) {                           // step 3
                 low = mid + 1;
-            } else {                                      // step 4
+            } else {                                         // step 4
                 high = mid - 1;
             }
         }
@@ -48,14 +48,14 @@ public static int binarySearchRec(Card[] cards, Card target,
         if (high < low) {
             return -1;
         }
-        int mid = (low + high) / 2;                       // step 1
+        int mid = (low + high) / 2;                          // step 1
         int comp = cards[mid].compareTo(target);
 
-        if (comp == 0) {                                  // step 2
+        if (comp == 0) {                                     // step 2
             return mid;
-        } else if (comp < 0) {                            // step 3
+        } else if (comp < 0) {                               // step 3
             return binarySearchRec(cards, target, mid + 1, high);
-        } else {                                          // step 4
+        } else {                                             // step 4
             return binarySearchRec(cards, target, low, mid - 1);
         }
     }
