this is an improved version of quicksort which does the sorting in place no additional space required except for call-stack space o log n call stack space on average . concode_field_sep PlaceHolder placeHolder concode_field_sep int partition concode_elem_sep void sortNaive concode_elem_sep void sortNaive concode_elem_sep void switchPositions
void function ( int [ ] arg0 , int arg1 , int arg2 ) { if ( arg1 >= arg2 ) return ; int loc0 = ( arg2 - arg1 ) / 2 + arg1 ; int loc1 = partition ( arg0 , arg1 , arg2 , loc0 ) ; sort ( arg0 , arg1 , loc1 - 1 ) ; sort ( arg0 , loc1 + 1 , arg2 ) ; }