package me.wayne.sort;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import me.wayne.sort.stable.BubbleSort;
import me.wayne.sort.stable.InsertionSort;
import me.wayne.sort.stable.MergeSort;
import me.wayne.sort.unstable.HeapSort;

public class TestSort {

    private static final Integer[] ARRAY =
            {98, 76, 109, 34, 67, 190, 80, 12, 14, 89, 1, 23, 33, 65, 567, 233, 190, 12};

    public static void sort() {
        System.out.println();

        List<Integer> data = Arrays.asList(ARRAY);
        System.out.println("raw data :\n" + data.toString());

        BubbleSort.sort(new ArrayList<Integer>(data));

        InsertionSort.sort(new ArrayList<Integer>(data));

        System.out.println(MergeSort.sort(new ArrayList<Integer>(data)));

        HeapSort.sort(new ArrayList<Integer>(data));
    }

}
@@ -43,224 +43,34 @@
 rray
-List;%0Aimport java.util.Arrays;%0Aimport java.util.List;%0A%0Aimport me.wayne.sort.stable.BubbleSort;%0Aimport me.wayne.sort.stable.InsertionSort;%0Aimport me.wayne.sort.stable.MergeSort;%0Aimport me.wayne.sort.unstable.HeapSort;
+s;%0Aimport java.util.List;%0A
 %0A%0Apu
@@ -411,251 +411,7 @@
     
-    BubbleSort.sort(new ArrayList%3CInteger%3E(data));%0A%0A        InsertionSort.sort(new ArrayList%3CInteger%3E(data));%0A%0A        System.out.println(MergeSort.sort(new ArrayList%3CInteger%3E(data)));%0A%0A        HeapSort.sort(new ArrayList%3CInteger%3E(data));%0A    %7D%0A
+%7D
 %0A%7D

change : change TestSort.java