If possible, how can I improve the following quick sort(performance wise). Any suggestions?
void main() { quick(a,0,n-1); } void quick(i
If this is not just for learning use qsort from stdlib.h