void quicksort (m,n); int m,n; int i,j; int v,x; if (n<=m)return; /fragment begins here*/ i=m-1;j=n;v=a [n]; while (1){ do i=i+1;while (a [i]<v); do j=j-1;while (a [j]>v); if (i>=j)break; =a[];a[叮=a];a=x; } x=a[叮；af叮=a[n];a[n=x; /*fragment ends here*/ quicksort (m,j);quicksort (i+1,n); 国防科技大学计算机系602教研室国防科技大学计算机系602教研室 void quicksort (m, n); int m, n; { int i, j; int v, x; if (n<=m) return; /* fragment begins here*/ i=m-1; j=n; v=a [n]; while (1) { do i=i+1; while (a [i]<v); do j=j-1; while (a [j]>v); if (i>=j) break; x=a [i]; a[i]=a [j]; a[j]=x; } x=a[i]; a[i]=a [n]; a [n]=x; /*fragment ends here*/ quicksort (m, j); quicksort (i+1, n); }