希尔排序（完整代码）

希尔排序是插入排序的一种。是针对直接插入排序算法的改进，该方法又称缩小增量排序。

#include "stdio.h"

void PrintfArray(int* ar, int left,int right)
{
	for (int i = left; i < right; i++)
		printf("%d ", ar[i]);
}

void _ShellSort(int* ar, int left, int right, int gap)
{
	for (int i = left + gap; i < right; i++)
	{
		int tmp = ar[i];
		int j = i;
		if (j > left && tmp < ar[j - gap])
		{
			ar[j] = ar[j - gap];
			j -= gap;
		}
		ar[j] = tmp;
	}
}

void ShellSort(int* ar, int left, int right)
{
	int dlta[] = { 5,3,2,1 };
	int n = sizeof(dlta) / sizeof(dlta[0]);
	for (int i = 0; i < n; i++)
	{
		_ShellSort(ar, left, right, dlta[i]);
	}
}

int main()
{
	int ar[] = {13,37,34,78,90,88,12 };
	int n = sizeof(ar) / sizeof(ar[0]);
	PrintfArray(ar, 0, n);
	ShellSort(ar, 0, n);
	printf("\n");
	PrintfArray(ar, 0, n);
}