#include <iostream>
using namespace std;
void InsertSort(int r[],const int n); //直接插入排序
void ShellSort(int r[],const int n); //希尔排序
void Print(int r[],const int n);
int main()
{
int array[11] = {0,59,20,17,36,98,14,23,83,13,28};
InsertSort(array,10);
Print(array,10);
ShellSort(array,10);
Print(array,10);
return 0;
}
void InsertSort(int r[],const int n) //0号单元用作暂存单元和监视哨
{
int i,j;
for (i = 2 ; i <= n ; i++)
{
r[0] = r[i];
for (j = i - 1; r[0] < r[j];j--)
r[j+1] = r[j];
r[j+1] = r[0];
}
}
void ShellSort(int r[], const int n)
{
int d,i,j;
for(d = n/2;d >= 1;d = d/2)
{
for(i=d+1; i<=n; i++)
{
r[0] = r[i];
for(j=i-d; j>0 && r[0]<r[j]; j=j-d)
r[j+d] = r[j];
r[j+d] = r[0];
}
}
}
void Print(int r[],const int n)
{
for(int i=1 ; i<=n ;i++)
cout<<r[i]<<' ';
cout<<endl;
}
结果都是:13 14 17 20 23 28 36 59 83 98