void quicksort( int tab2[ ] , int left, int right) {
int v= tab2[ ( left+ right) / 2 ] ;
int i,j,x;
i= left;
j= right;
do {
while ( tab2[ i] < v) i++ ;
while ( tab2[ j] > v) j-- ;
if ( i<= j) {
x= tab2[ i] ;
tab2[ i] = tab2[ j] ;
tab2[ j] = x;
i++ ; j-- ;
}
} while ( i<= j) ;
if ( j> left) quicksort( tab2,left, j) ;
if ( i< right) quicksort( tab2, i, right) ;
}
dm9pZCBxdWlja3NvcnQoaW50IHRhYjJbXSwgaW50IGxlZnQsIGludCByaWdodCl7CgogICAgaW50IHY9dGFiMlsobGVmdCtyaWdodCkvMl07CiAgICBpbnQgaSxqLHg7CiAgICBpPWxlZnQ7CiAgICBqPXJpZ2h0OwogICAgIGRvewogICAgICAgICB3aGlsZSAodGFiMltpXTx2KSBpKys7CiAgICAgICAgIHdoaWxlICh0YWIyW2pdPnYpIGotLTsKICAgICAgICAgaWYgKGk8PWopewogICAgICAgICB4PXRhYjJbaV07CiAgICAgICAgIHRhYjJbaV09dGFiMltqXTsKICAgICAgICAgdGFiMltqXT14OwogICAgICAgICBpKys7IGotLTsKICAgICAgICAgfQogICAgIH13aGlsZSAoaTw9aik7CiAgICAgaWYgKGo+bGVmdCkgcXVpY2tzb3J0KHRhYjIsbGVmdCwgaik7CiAgICAgaWYgKGk8cmlnaHQpIHF1aWNrc29ydCh0YWIyLCBpLCByaWdodCk7Cn0=