QuickSort(a, lo, hi); InsertionSort(a, lo, hi);
IntroSort(a, lo, hi, 2*(int)Math.floor(Math.log(hi-lo+1)/LOG2));
	public static void sort(Comparable[] a, int lo, int hi) {		QuickSort(a, lo, hi);		InsertionSort(a, lo, hi);	}