算法(第4版) C++ 实现希尔排序(简易版)

Posted 2021-05-16 Wecccccccc

#include <iostream>
using namespace std;

void shellsort(int *a,int n)
{
	int h = 1;
	while (h < n / 3) h = 3 * h + 1;
	while (h >= 1)
	{
		for (int i = h;i<n;i++)
			for (int j = i; j >= h && a[j] < a[j - h]; j -= h)
			{
				int t = a[j];
				a[j] = a[j - h];
				a[j - h] = t;
			}
		h = h / 3;
	}
}


int main()
{
	int a[] = { 12,42,34,21,53,52,4,523,4,213,124,2,412,3214,124,124,12 };
	shellsort(a, 17);
	for (int i = 0; i < 17; i++) cout << a[i] << " ";
	cout << endl;
	return 0;
}

测试结果: