public void sort(Object[] dest, int low, int high) {
		// int length = high - low;

		// Insertion sort on smallest arrays
		// if (length < INSERTIONSORT_THRESHOLD) {
		for (int i = low; i < high; i++)
			for (int j = i; j > low && ((Comparable) dest[j - 1]).compareTo(dest[j]) > 0; j--)
				// swap
				swap(dest, j, j - 1);
		return;
		// }
	}