...

Author: coderodde

src/main/java/com/github/coderodde/util/ParallelRadixSort.java

@@ -229,6 +229,7 @@ private static void radixSortImpl(int[] source,
             bucketSizeMap[bucketIndex]++;
         }
 
+        //
         // Compute starting indices for buckets in the target array. This is 
         // actually just an accumulated array of bucketSizeMap, such that
         // startIndexMap[0] = 0, startIndexMap[1] = bucketSizeMap[0], ...,

src/test/java/com/github/coderodde/util/ParallelRadixSortTest.java

@@ -11,8 +11,8 @@ public final class ParallelRadixSortTest {
 
     @BeforeClass
     public static void setupBeforeClass() {
-        ParallelRadixSort.setInsertionSortThreshold(-1);
-        ParallelRadixSort.setMergesortThreshold(-1);
+//        ParallelRadixSort.setInsertionSortThreshold(-1);
+//        ParallelRadixSort.setMergesortThreshold(-1);
     }
 
     @Test
@@ -56,7 +56,9 @@ public void testMergesort() {
     @Test
     public void testSerialRadixSort() {
         Random random = new Random(26);
-        final int SIZE = 500;
+
+        final int SIZE = 50_000;
+
         int[] array1 = Utils.createRandomIntArray(
                 SIZE, 
                 Integer.MAX_VALUE - 1,