InPlaceStableQuicksort

A stable quicksort implementation that uses O(log(n)) memory. It normally runs in O(n*log(n)*log(n)), but at most in O(n^2).

Methods
static void	sort(T[] data, Comparator comp) Sort an array using the given comparator.
static void	sort(T[] data, Comparator comp) Sort an array using the given comparator. Parameters: data - the data array to sort comp - the comparator
void	sortArray(T[] d, Comparator c) Sort an array using the given comparator.
void	sortArray(T[] d, Comparator c) Sort an array using the given comparator. Parameters: d - the data array to sort c - the comparator