Sorting algorithms/Insertion sort: Difference between revisions

 

Using some built-in algorithms (warning: not stable, due to the lack of an "upper bound" binary search function)

<lang java5>public static <E extends Comparable<? super E>> void insertionSort(List<E> a) {

for (int i = 1; i < a.size(); i++) {