select a pivot . to ensure a good pivot is select , the median element of a sample of the data is calculated . concode_field_sep Comparator<T> comp concode_elem_sep T[] temp concode_elem_sep int TEMP_SIZE concode_elem_sep T[] data concode_elem_sep int INSERTION_SORT_SIZE concode_field_sep T select concode_elem_sep int partition concode_elem_sep void swap concode_elem_sep void swapBlocks concode_elem_sep int partitionSmall concode_elem_sep void sortArray concode_elem_sep void sort concode_elem_sep int binarySearch concode_elem_sep void reverseBlock concode_elem_sep void quicksort concode_elem_sep void binaryInsertionSort concode_elem_sep int selectPartition
T function ( int arg0 , int arg1 ) { int loc0 = ( int ) ( 6 * Math . log10 ( arg1 - arg0 ) ) ; loc0 = Math . min ( loc0 , temp . length ) ; int loc1 = ( arg1 - arg0 ) / loc0 ; for ( int loc2 = arg0 , loc3 = 0 ; loc2 < arg1 ; loc2 += loc1 , loc3 ++ ) { temp [ loc3 ] = data [ loc2 ] ; } T loc4 = select ( temp , 0 , loc0 - 1 , loc0 / 2 ) ; return loc4 ; }