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(Comparable[] array) { sort(qs, new SortableArray(array)); } public static void quickSort(Object[] array, Comparator comparator) { sort(qs, new SortableArray(array, comparator)); } public static void quickSort(List l) { sort(qs, new SortableList(l)); } public static void quickSort(List l, Comparator comparator) { sort(qs, new SortableList(l, comparator)); } public static void insertionSort(Comparable[] array) { sort(is, new SortableArray(array)); } public static void insertionSort(Object[] array, Comparator comparator) { sort(is, new SortableArray(array, comparator)); } public static void insertionSort(List l) { sort(is, new SortableList(l)); } public static void insertionSort(List l, Comparator comparator) { sort(is, new SortableList(l, comparator)); } }