testing radix sort.

Author: iTimeTraveler

src/main/java/com/example/Bench.java

@@ -106,6 +106,13 @@ public static interface Function<A, B> {
         }
     };
 
+    public static Function<int[], int[]> radixSort = new Function<int[], int[]>() {
+        @Override public int[] apply(int[] array) {
+            SortAlgorithms.radixSort(array);
+            return array;
+        }
+    };
+
     // Execute an algorithm on an input and return its runtime.
     private static String execute(Function<int[], int[]> algorithm, int[] input) {
         // To get accurate results even for small inputs, we repeat
@@ -208,7 +215,8 @@ private static void executionTimeReport(int size) {
             "Heap sort      | %14s | %14s | %14s\n" +
             "Bubble sort    | %14s | %14s | %14s\n" +
             "Quicksort      | %14s | %14s | %14s\n" +
-            "Merge sort     | %14s | %14s | %14s\n",
+            "Merge sort     | %14s | %14s | %14s\n" +
+            "Radix sort     | %14s | %14s | %14s\n",
             size,
             "Random", "95% sorted", "Sorted",
             execute(insertionSort, randomSample),
@@ -237,7 +245,11 @@ private static void executionTimeReport(int size) {
 
             execute(mergeSort,  randomSample),
             execute(mergeSort,  partiallySortedSample),
-            execute(mergeSort,  sortedSample)
+            execute(mergeSort,  sortedSample),
+
+            execute(radixSort,  randomSample),
+            execute(radixSort,  partiallySortedSample),
+            execute(radixSort,  sortedSample)
         ));
     }
 }

src/main/java/com/example/SortAlgorithms.java

@@ -19,7 +19,7 @@
  *
  */
 class SortAlgorithms {
-    public static final boolean ENABLE_PRINT = true;
+    public static final boolean ENABLE_PRINT = false;
 
     public static void main(String[] args) {
 //        int[] array = new int[]{3,5,3,0,8,6,1,5,8,6,2,4,9,4,7,0,1,8,9,7,3,1,2,5,9,7,4,0,2,6};
@@ -319,7 +319,7 @@ public static void radixSort(int[] arr){
         System_out_println("maxDigit: " + maxDigit);
 
         //申请一个桶空间
-        int[][] buckets = new int[10][arr.length-1];
+        int[][] buckets = new int[10][arr.length];
         int base = 10;
 
         //从低位到高位，对每一位遍历，将所有元素分配到桶中

src/main/java/com/example/Test.java

@@ -8,7 +8,15 @@
 public class Test {
     private static Bench.Function<int[], int[]> algorithm =
         // Change to Bench.quickSort or Bench.mergeSort as appropriate.
-        Bench.shellSort;        // 需要测试的排序算法
+        Bench.insertionSort; //直接插入排序        // 需要测试的排序算法
+//        Bench.shellSort;	 //希尔排序
+//        Bench.selectionSort; //简单选择排序
+//        Bench.heapSort;		 //堆排序
+//        Bench.bubbleSort;	 //冒泡排序
+//        Bench.quickSort;	 //快速排序
+//        Bench.mergeSort;	 //归并排序
+//        Bench.radixSort;	 //基数排序
+
 
     private static boolean check(int[] array) {
         int[] reference = Arrays.copyOf(array, array.length);