看下面代码有什么不同
//快速排序int partition(int a[],int p,int r){ int x = a[p]; int i = p; int j = r; while(1) { while (a[j] > x) --j; while (a[i] < x) ++i; if (i < j) { int t = a[i]; a[i] = a[j]; a[j] = t; } else return j; }}void quick(int a[],int p,int r){ if (p < r) { int q = partition(a,p,r); quick(a,p,q); quick(a,q + 1,r); }}void quicksort(int a[]){ quick(a,0,sizeof(a)/sizeof(int) - 1);}