Update the sorts in code comments.

Author: phishman3579

src/com/jwetherell/algorithms/sorts/AmericanFlagSort.java

@@ -26,8 +26,7 @@ private AmericanFlagSort() {
     }
 
     public static Integer[] sort(Integer[] unsorted) {
-        int numberOfDigits = getMaxNumberOfDigits(unsorted); // Max number of
-                                                             // digits
+        int numberOfDigits = getMaxNumberOfDigits(unsorted); // Max number of digits
         int max = 1;
         for (int i = 0; i < numberOfDigits - 1; i++)
             max *= 10;

src/com/jwetherell/algorithms/sorts/HeapSort.java

@@ -37,24 +37,16 @@ private static <T extends Comparable<T>> void sortHeap(T[] unsorted) {
                 if (left >= index) // node has no left child
                     break;
                 int right = left + 1;
-                if (right >= index) { // node has a left child, but no right
-                                      // child
+                if (right >= index) { // node has a left child, but no right child
                     if (unsorted[left].compareTo(unsorted[i]) > 0)
-                        swap(left, i, unsorted); // if
-                                                 // left
-                                                 // child
-                                                 // is
-                                                 // greater
-                                                 // than
-                                                 // node
+                        swap(left, i, unsorted); // if left child is greater than node
                     break;
                 }
                 T ithElement = unsorted[i];
                 T leftElement = unsorted[left];
                 T rightElement = unsorted[right];
                 if (ithElement.compareTo(leftElement) < 0) { // (left > i)
-                    if (unsorted[left].compareTo(rightElement) > 0) { // (left >
-                                                                      // right)
+                    if (unsorted[left].compareTo(rightElement) > 0) { // (left > right)
                         swap(left, i, unsorted);
                         i = left;
                         continue;

src/com/jwetherell/algorithms/sorts/RadixSort.java

@@ -31,10 +31,8 @@ private RadixSort() {
     public static Integer[] sort(Integer[] unsorted) {
         int[][] buckets = new int[NUMBER_OF_BUCKETS][10];
         for (int i = 0; i < NUMBER_OF_BUCKETS; i++)
-            buckets[i][0] = 1; // Size is one since the size is stored in first
-                               // element
-        int numberOfDigits = getMaxNumberOfDigits(unsorted); // Max number of
-                                                             // digits
+            buckets[i][0] = 1; // Size is one since the size is stored in first element
+        int numberOfDigits = getMaxNumberOfDigits(unsorted); // Max number of digits
         int divisor = 1;
         for (int n = 0; n < numberOfDigits; n++) {
             int digit = 0;