void function ( int arg0 , int arg1 ) { for ( int loc0 = arg0 + 1 ; loc0 <= arg1 ; loc0 ++ ) { T loc1 = data [ loc0 ] ; int loc2 = binarySearch ( loc1 , arg0 , loc0 - 1 ) ; for ( int loc3 = loc0 - 1 ; loc3 >= loc2 ; loc3 -- ) { data [ loc3 + 1 ] = data [ loc3 ] ; } data [ loc2 ] = loc1 ; } }
sort a block using the binary insertion sort algorithm . 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 T selectPivot concode_elem_sep void sort concode_elem_sep int binarySearch concode_elem_sep void reverseBlock concode_elem_sep void quicksort concode_elem_sep int selectPartition