\u6392\u5e8f\u7b97\u6cd5-\u5feb\u901f\u6392\u5e8f(\u4e09\u8005\u53d6\u4e2d\u5283\u5206)<\/p>\n
\u5feb\u901f\u6392\u5e8f\u7b97\u6cd5\u7684\u4e00\u500b\u6539\u9032\u7248\u672c,\u5728\u6578\u7d44\u53d6\u4e09\u500b\u5143\u7d20\u7684\u4e2d\u9593\u9032\u884c\u5283\u5206.\u9019\u6a23\u53ef\u4ee5\u907f\u514d\u51fa\u73fe\u6700\u58de\u7684\u60c5\u6cc1.<\/p>\n
\u53d6\u6578\u7d44\u7684\u5de6\u908a,\u4e2d\u9593,\u53f3\u908a\u7684\u5143\u7d20.\u5c0d\u9019\u4e09\u500b\u6578\u9032\u884c\u6392\u5e8f.<\/p>\n
#define less(A,B)\u00a0\u00a0\u00a0\u00a0 ((A)<(B)) \/\/ \u5c0f\u65bc\u6bd4\u8f03<\/p>\n
#define exch(A,B)\u00a0\u00a0\u00a0\u00a0 {int temp=A; A=B; B=temp;} \/\/ \u4ea4\u63db<\/p>\n
#define compexch(A,B) if(less(A,B)) exch(A,B) \/\/ \u5c0f\u65bc\u5247\u4ea4\u63db<\/p>\n
\u4e0b\u9762\u7d66\u51faC\u4ee3\u78bc\u7684\u5be6\u73fe.<\/p>\n
\/\/ \u5283\u5206\u7b97\u6cd5<\/p>\n
\/\/a:\u6578\u7d44<\/p>\n
\/\/l:\u6578\u7d44\u7684\u5de6\u5247\u7d22\u5f15<\/p>\n
\/\/r:\u6578\u7d44\u7684\u53f3\u5247\u7d22\u5f15<\/p>\n
void quicksort(int a[],int l,int r)<\/p>\n
{<\/p>\n
int i;<\/p>\n
int temp;<\/p>\n
\/\/ a[(l+r)\/2] \u8207 a[r-1]\u4ea4\u63db<\/p>\n
exch(a[(l+r)\/2], a[r-1]);<\/p>\n
\/\/ \u53d6\u6578\u7d44\u7684\u5de6\u908a,\u4e2d\u9593,\u53f3\u908a\u7684\u5143\u7d20.\u5c0d\u9019\u4e09\u500b\u6578\u9032\u884c\u6392\u5e8f.<\/p>\n
\/\/ \u5c0f\u65bc\u5247\u4ea4\u63db<\/p>\n
compexch(a[r-1],a[l]);<\/p>\n
compexch(a[r],\u00a0 a[l]);<\/p>\n
compexch(a[r],\u00a0 a[r-1]);<\/p>\n
i = partition(a,l+1,r-1);<\/p>\n
quicksort(a[],l,\u00a0 i-1);<\/p>\n
quicksort(a[],i+1,r);<\/p>\n
}<\/p>\n
\/\/ \u5283\u5206\u7b97\u6cd5<\/p>\n
\/\/a:\u6578\u7d44<\/p>\n
\/\/l:\u6578\u7d44\u7684\u5de6\u5247\u7d22\u5f15<\/p>\n
\/\/r:\u6578\u7d44\u7684\u53f3\u5247\u7d22\u5f15<\/p>\n
int partition(int a[],int l,int r)<\/p>\n
{<\/p>\n
int i,j,v,t;<\/p>\n
i = l;<\/p>\n
j = r;<\/p>\n
v = a[j];\/\/\u9078\u5247\u6700\u53f3\u5247\u7684\u5143\u7d20\u4f5c\u70ba\u5283\u5206\u5143\u7d20v<\/p>\n
while(true)<\/p>\n
{<\/p>\n
while(a[i]<v)<\/p>\n
++i;\/\/ i\u7684\u5de6\u5247\u5c0f\u8207v<\/p>\n
while(v<a[j])<\/p>\n
{<\/p>\n
++j;\/\/ j\u7684\u53f3\u5247\u5927\u8207v<\/p>\n
if(j==l)<\/p>\n
break;\/\/ \u8df3\u51fa<\/p>\n
}<\/p>\n
if(i>=j)<\/p>\n
break;\/\/ \u5169\u500b\u6307\u91dd\u76f8\u9047\u8df3\u51fa\u6383\u63cf.<\/p>\n
\/\/ \u4ea4\u63dbi,j,\u4ea4\u63db\u90a3\u4e9b\u4f7f\u6383\u63cf\u505c\u6b62\u7684\u5143\u7d20.<\/p>\n
t=a[i];<\/p>\n
a[i]=a[j];<\/p>\n
a[j]=t;<\/p>\n
}<\/p>\n
\/\/ \u4ea4\u63dbi,r,\u4fdd\u8b49v\u7684\u5de6\u5247\u5c0f\u65bc\u65bc\u5b83,v\u7684\u53f3\u5247\u5927\u65bc\u5b83.<\/p>\n
t=a[i];<\/p>\n
a[i]=a[r];<\/p>\n
a[r]=t;<\/p>\n
return i;<\/p>\n
}<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6392\u5e8f\u7b97\u6cd5-\u5feb\u901f\u6392\u5e8f(\u4e09\u8005\u53d6\u4e2d\u5283\u5206) \u5feb\u901f\u6392\u5e8f\u7b97\u6cd5\u7684\u4e00\u500b\u6539\u9032\u7248\u672c,\u5728\u6578\u7d44\u53d6\u4e09\u500b\u5143\u7d20\u7684\u4e2d\u9593\u9032\u884c\u5283\u5206.\u9019\u6a23\u53ef\u4ee5\u907f\u514d\u51fa … <\/p>\n