void function ( Comparable [ ] arg0 ) { int loc0 = arg0 . length ; Comparable [ ] loc1 = new Comparable [ loc0 ] ; for ( int loc2 = 1 ; loc2 < loc0 ; loc2 = loc2 + loc2 ) { for ( int loc3 = 0 ; loc3 < loc0 - loc2 ; loc3 += loc2 + loc2 ) { int loc4 = loc3 ; int loc5 = loc3 + loc2 - 1 ; int loc6 = Math . min ( loc3 + loc2 + loc2 - 1 , loc0 - 1 ) ; merge ( arg0 , loc1 , loc4 , loc5 , loc6 ) ; } } assert isSorted ( arg0 ) ; }
rearranges the array in ascending order , using the natural order . concode_field_sep PlaceHolder placeHolder concode_field_sep void merge concode_elem_sep void exch concode_elem_sep void show concode_elem_sep void main concode_elem_sep boolean less concode_elem_sep boolean isSorted