\u6392\u5e8f\u7b97\u6cd5-\u5e0c\u5c14\u6392\u5e8f
\n1.\u5e0c\u5c14\u6392\u5e8f\u662f\u67e5\u5165\u6392\u5e8f\u7684\u6269\u5c55\u7248.\u5728\u626b\u63cf\u6570\u636e\u65f6,\u628a\u79fb\u52a8\u7684\u589e\u91cf\u6216\u51cf\u91cf\u7531\u539f\u6765\u76841\u53d8\u6210h.
\n2.h\u5c31\u662f\u6b65\u957f.\u5bf9\u4e8e\u6bcf\u4e2ah,\u5bf9\u6bcf\u4e2ah\u5355\u72ec\u4f7f\u7528\u63d2\u5165\u6392\u65a5.<\/p>\n
\u4e0b\u9762\u7ed9\u51faC\u4ee3\u7801\u7684\u5b9e\u73b0.
\n\/\/a:\u6570\u7ec4
\n\/\/l:\u6570\u7ec4\u7684\u957f\u5ea6
\nvoid shellsort(int a[],int l)
\n{
\nint i,j;
\nint h;\/\/ \u6b65\u957f
\nint v;<\/p>\n
\/\/ \u8ba1\u7b97\u6b65\u957f
\nh=1;
\nwhile(h<=l\/9)
\nh=3*h+1;<\/p>\n
for(;h>0; h\/=3)\/\/ \u6539\u8fb9\u6b65\u957f
\n{
\nfor(i=h; i<=l; ++i)\/\/ \u4f7f\u7528\u63d2\u5165\u6392\u65a5
\n{
\nj=i;
\nv=a[i];
\nwhile(j>=h && v < a[j-h])
\n{
\na[j]=a[j-h];
\nj-=h;
\na[j]=v;
\n}
\n}
\n}
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6392\u5e8f\u7b97\u6cd5-\u5e0c\u5c14\u6392\u5e8f 1.\u5e0c\u5c14\u6392\u5e8f\u662f\u67e5\u5165\u6392\u5e8f\u7684\u6269\u5c55\u7248.\u5728\u626b\u63cf\u6570\u636e\u65f6,\u628a\u79fb\u52a8\u7684\u589e\u91cf\u6216\u51cf\u91cf\u7531\u539f\u6765\u76841\u53d8\u6210h. 2.h … <\/p>\n