void quicksort(m,n);內快速排序 int m, n, int l, J5 int V, x; if(n≤=m) return fragment begins here*/ =m-1;j=n;v=a[n]; while(1)i do i=i+1; while(a [s<v) do j=j-1; while(a d>v) if(>可 break; X=ac可=ai;a]=x; X=a[; at=a [ n; a [n=x /fragment ends here*/ d, quicksort(m, j); quicksort(i+1, n) 以下列出在两个 fragment直接代码的中间代码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); }以下列出在两个fragment直接代码的中间代码