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