void function ( T [ ] arg0 , int arg1 , int arg2 , Comparator < T > arg3 ) { for ( int loc0 = arg1 + 1 , loc1 ; loc0 <= arg2 ; loc0 ++ ) { T loc2 = arg0 [ loc0 ] ; for ( loc1 = loc0 - 1 ; loc1 >= arg1 && arg3 . compare ( arg0 [ loc1 ] , loc2 ) > 0 ; loc1 -- ) { arg0 [ loc1 + 1 ] = arg0 [ loc1 ] ; } arg0 [ loc1 + 1 ] = loc2 ; } }
sort an array using insertion sort concode_field_sep PlaceHolder placeHolder concode_field_sep void binaryInsertionSort