fun sort(keys: IntArray?, values: IntArray?, offset: Int, length: Int) { hybridsort(keys, values, offset, offset + length - 1) }
Sorts a range from the keys in an increasing order . Elements key [ i ] and values [ i ] are always swapped together in the corresponding arrays . < p > A mixture of several sorting algorithms is used : < p > A radix sort performs better on the numeric data we sort , but requires additional storage to perform the sorting . Therefore only the not-very-large parts produced by a quick sort are sorted with radix sort . An insertion sort is used to sort the smallest arrays , where the the overhead of the radix sort is also bigger