希尔排序

//希尔排序
/*#include<iostream>
using namespace std;

int main()
{
	int a[10], i, j, temp, gap;
	gap = 10 / 2;
	for (i = 0; i < 10; i++)
		cin >> a[i];
	while (gap >= 1)
	{
		for(i = gap; i < 10; i++)
		{
			temp = a[i];
			for (j = i - gap; j >= 0 && temp < a[j]; j = j - gap)
				a[j + gap] = a[j];
			a[j + gap] = temp;
		}
		gap = gap / 2;
	}
	for (i = 0; i < 10; i++)
		cout << a[i] << "  ";
	return 0;
	{

	}
}*/