标签：排序算法
#include<iostream>
using namespace std;
void ShellSort(int *a,int length)
{
if (a == NULL || length <= 0)
{
return;
}
int gap = length;
while (gap != 1)
{
if (gap > 1)
{
gap = gap / 3 + 1;
}
for (int begin = gap; begin < length; begin += gap)
{
int index = begin;
int tmp = a[begin];
while (index)
{
if (tmp < a[index - gap])
{
a[index] = a[index - gap];
}
else
{
break;
}
index -= gap;
}
if (tmp < a[index])
{
a[index] = tmp;
}
}
}
}
void SellSortTest()
{
int a[] = { 3, 6, 2, 8, 1, 5, 9, 4, 7, 0 };
ShellSort(a, 10);
for (int i = 0; i < sizeof(a) / sizeof(a[0])-1; i++)
{
cout << a[i] << " ";
}
cout << endl;
}
int main()
{
SellSortTest();
return 0;
}
标签：排序算法
原文地址：http://zheng2048.blog.51cto.com/10612048/1760325
