sorts the specified array of objects into ascending order , according to the @linkplain comparable natural ordering of its elements . all elements in the array must implement the comparable interface . furthermore , allelements in the array must be mutually comparable that is , e1.compareto e2 must not throw a classcastexception for any elements e1 and e2 in the array . this sort is guaranteed to be stable : equal elements will not be reordered as a result of the sort . the sorting algorithm is a modified mergesort in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist . this algorithm offers guaranteed nlog n performance . concode_field_sep int INSERTIONSORT_THRESHOLD concode_field_sep void swap concode_elem_sep void mergeSort concode_elem_sep void mergeSort
void function ( Object [ ] arg0 ) { Object [ ] loc0 = ( Object [ ] ) arg0 . clone ( ) ; mergeSort ( loc0 , arg0 , 0 , arg0 . length , 0 ) ; }