[Sort]希尔排序

详细介绍，在本博客的数据结构栏目里有，不过是java版

#include<iostream>using namespace std;void Shell_Sort(int a[],int num){    int d,i,j,c;    for(d = num/2;d>0;d/=2)    {        for(i = d;i<num;i++)        {            if(a[i] < a[i-d])            {                c = a[i];                for(j=i-d;a[j]> c && j>=0;j-=d)                {                    a[j+d] = a[j];                }                a[j+d] = c;            }        }    }}void main(){    int a[] = {57,68,59,52,72,28,96,33,24};    int count = sizeof(a) / sizeof(a[0]);    Shell_Sort(a,count);    for(int i=0;i<count;i++)    {        cout<<a[i]<<" ";    }    cout<<endl;}