If possible, how can I improve the following quick sort(performance wise). Any suggestions?
void main() { quick(a,0,n-1); } void quick(i
The wikipedia article on quicksort has a bunch of ideas.