希尔排序法

#include<iostream>
using namespace std;
//希尔排序法
int main()
{
int a[] = { 6, 9, 2, 3, 4, 7, 5, 1 };
int size = sizeof(a) / sizeof(a[0]);//数组的大小

int jmp=size/2;

int i,j;
int temp;//用来暂存数据
while (jmp != 0)
{
for (i = jmp; i < size; i++)
{
temp = a[i];
j = i - jmp;
while (temp < a[j] && j >= 0)
{
a[j + jmp] = a[j];
j = j - jmp;
}
a[jmp + j] = temp;
}

jmp = jmp / 2;

}

for (int i = 0; i < size; i++)//输出排好序的数组
cout << a[i] << " ";

return 0;
}

希尔排序法

原文：http://www.cnblogs.com/a-dreaming-dreamer/p/5812799.html