1.思想:
带间隔的插入排序。最后一趟相当于插入排序。
2.实现:
// 希尔排序 -- 思想
/*
增量递减的 插入排序
*/
#include<iostream>
using namespace std;
void shellSort(int* a, int length, int gap)
{
for (int i = gap; i < length; i++)
{
int temp = a[i];
int j = i-gap;
while (a[j] > temp && j >= 0)
{
a[j + gap] = a[j];
j -= gap;
}
a[j + gap] = temp;
}
}
int main()
{
int a[] = { 31,23,97,64,108,14,88,2,34,6 };
int length = sizeof(a) / sizeof(a[0]);
int gap = length;
while (gap > 1)
{
gap /= 2;
shellSort(a, length,gap);
}
for (int i = 0; i < length; i++)
{
cout << a[i] << " ";
}
cout << endl;
//cout << 5 / 2 << endl; // 2
system("pause");
return 0;
}
3.输出: