public interface SortInterface
{
    public void insertionSort(int[] array, int lowindex, int highindex, boolean reversed);
    public void bubbleSort(int[] array, int lowindex, int highindex, boolean reversed);
    public void bucketSort(int[] array, int lowindex, int highindex, boolean reversed);
    public void shellSort(int[] array, int lowindex, int highindex, boolean reversed);
    public void mergeSort(int[] array, int lowindex, int highindex, boolean reversed);
    public void quickSort(int[] array, int lowindex, int highindex, boolean reversed);
    public void heapSort(int[] array, int lowindex, int highindex, boolean reversed);    
    public void radixSort(int[] array, int lowindex, int highindex, boolean reversed);
    public LLNode mergeSortLL(LLNode list, boolean reversed);
    public LLNode insertionSortLL(LLNode list, boolean reversed);
    public void optimizedQuickSort(int[] array, int lowindex, int highindex, boolean reversed);
}