Yury Serdyuk wrote: > public static void local_quicksort ( int first, int last ) { > > int k, l; > int tmp; > > if ( first >= last ) > return; > > int pivot = x [ first ]; > This is wrong: > k = 1; > l = last; > > while ( x [ k ] <= pivot && k < last ) > k++; Robert