InsertionSort.java

public class InsertionSort {
    public static <T extends Comparable<? super T>> void insertionSort(T[] array, int start, int end) {
        for (int unsorted = start; unsorted <= end; unsorted++) {
            T firstUnsorted = array[unsorted];
            System.out.println("In insertionSort, firstUnsorted is: " + firstUnsorted);

            orderedInsert(firstUnsorted,  array, start, unsorted - 1);
        }
    }

    private static <T extends Comparable<? super T>> void orderedInsert(T entry, T[] array, int start, int end) {
        int index = end;

        while ((index >= start) && (entry.compareTo(array[index]) < 0)) {
            array[index + 1] = array[index];
            index--;
            System.out.println("In orderedInsert while loop");
            SortingDriver.displayCurrent(array);
        }

        array[index + 1] = entry;
        System.out.println("In orderedInsert outside while loop");
        SortingDriver.displayCurrent(array);
    }
}