mergeSort(PositionList<E> in,
Comparator<E> c)
Sorts the elements of list in in nondecreasing order according
to comparator c, using the merge-sort algorithm.

static

<E> void

quickSort(E[] s,
Comparator<E> c)
Sorts the elements of array s in nondecreasing order according
to comparator c, using the quick-sort algorithm.

static

<E> void

quickSort(PositionList<E> in,
Comparator<E> c)
Sorts the elements of list in in nondecreasing order according to
comparator c, using a list-based implementation of the deterministic
quicksort algorithm.