希尔排序：

#include
#include
using namespace std;

//希尔排序：
int main()
{
//vector vec = { 2,3,4,5,15,19,16,27,36,38,44,46,47,48,50 };
vector vec = { 3, 5, 3, 0, 8, 6, 1, 5, 8, 6, 2, 4, 9, 4, 7, 0, 1, 8, 9, 7, 3, 1, 2, 5, 9, 7, 4, 0, 2, 6 };
//vector vec = { 0,5,3,4,6,2,0 };
//vector vec = { 5,6,1,8,3,4,9,7,2,3 };
int len = vec.size();
int h = 1;
while (h < len / 3) h = 3 * h + 1;
while (h >= 1)
{
for (int i = h; i < len; ++i)
for (int j = i; j >= h && vec[j] < vec[j - h]; j -= h)
swap(vec[j], vec[j - h]);
h = h / 3;
}
for (auto w : vec)
cout << w << " ";
cout << endl;
return 0;
}

 0  0  0  1  1  1  2  2  2  3  3  3  4  4  4  5  5  5  6  6  6  7  7  7  8  8  8  9  9  9

C:\Projects_all\Work_algorithm\Project7\Debug\Project7.exe (进程 27864)已退出，返回代码为: 0。
按任意键关闭此窗口...