8)排序③排序算法之插入排序[2]希尔排序

#include<iostream>
using namespace std;

int shell_sort(int n,int array[100]){//希尔排序法
    register int dh,temp,i,j;
    dh=n/2;
    while(dh>=1){
        for( i=dh;i<n;i++){
            temp=array[i];
            j=i-dh;
            while(j>=0&&array[j]>temp){
                array[j+dh]=array[j];    
                j-=dh;
            }
            array[j+dh]=temp;
        }
        dh/=2;
    }
    return 0;
}
int print(int n,int array[100]){
    int i;
    for(i=0;i<n;i++){
        cout<<array[i]<<" ";
    }
    cout<<endl;
    return 0;
}
int main()
{
    int array[10]={5,7,8,2,3,5,4,3,2,1};
    shell_sort(10,array);
    print(10,array);
    return 0;
}