void function ( int [ ] arg0 ) { for ( int loc0 = 1 ; loc0 < arg0 . length ; loc0 ++ ) { int loc1 = arg0 [ loc0 ] ; int loc2 = loc0 - 1 ; for ( ; loc2 >= 0 && ( arg0 [ loc2 ] > loc1 ) ; loc2 -- ) { arg0 [ loc2 + 1 ] = arg0 [ loc2 ] ; } arg0 [ loc2 + 1 ] = loc1 ; } }
implementation of insertion sort for integers . this has an average performance of o n log n concode_field_sep PlaceHolder placeHolder concode_field_sep void bubbleSort concode_elem_sep int partition concode_elem_sep void swap concode_elem_sep void merge concode_elem_sep void mergeSort concode_elem_sep void mergeSort concode_elem_sep void quicksort concode_elem_sep void quicksort