package sort; import java.util.Comparator; import java.util.List; /* * Created on 27 oct. 2004 * */ /** * @author baudon * */ public class Sorts { private static QuickSort qs = new QuickSort(); private static InsertionSort is = new InsertionSort(); private static void sort(Sort s, SortableData data) { s.doSort(data); } public static > void quickSort(T [] array) { sort(qs, new SortableComparableData(new SwapableArray(array))); } public static void quickSort(T [] array, Comparator comparator) { sort(qs, new SortableDataWithComparator(new SwapableArray(array), comparator)); } public static > void quickSort(List l) { sort(qs, new SortableComparableData(new SwapableList(l))); } public static void quickSort(List l, Comparator comparator) { sort(qs, new SortableDataWithComparator(new SwapableList(l), comparator)); } public static > void insertionSort(T [] array) { sort(is, new SortableComparableData(new SwapableArray(array))); } public static void insertionSort(T [] array, Comparator comparator) { sort(is, new SortableDataWithComparator(new SwapableArray(array), comparator)); } public static > void insertionSort(List l) { sort(is, new SortableComparableData(new SwapableList(l))); } public static void insertionSort(List l, Comparator comparator) { sort(is, new SortableDataWithComparator(new SwapableList(l), comparator)); } }