希尔排序实现

// c_dataStructure.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<iostream>

using namespace std;

template<class T>
void ShellSort(T data[], T arrSize) {
	register int i, j, hCnt, h;
	int increments[20], k;
	// 创建适当大小的数组crements
	for (h = 1, i = 0; h < arrSize; i++) {
		increments[i] = h;
		h = 3 * h + 1;
	}

	// 开始使用生成的数组crements依次对数组进行希尔排序
	for (i--; i >= 0; i--) {
		h = increments[i];

		for (hCnt = h; hCnt < 2 * h; hCnt++) {
			for (j = hCnt; j < arrSize;) {
				T tmp = data[j];
				k = j;
				while (k - h > 0 && tmp < data[k - h]) {
					data[k] = data[k - h];
					k -= h;
				}
				data[k] = tmp;
				j += h;
			}
		}
	}
}

template<class T>
void ShellSort_1(T data[], T arrSize) {
	int i = 0, j = 0, k = 0, gap = arrSize, tmp = 0;
	do {
		gap = gap / 3 + 1;
		for (i = gap; i < arrSize; i += gap) {
			k = i;
			tmp = data[k];
			for (j = i - gap; j > 0 && tmp < data[j]; j -= gap){
				data[j + gap] = data[j];
				k = j;
			}
			data[k] = tmp;
		}
	} while (gap > 1);
}

template<class T>
void swap(T a, T b) {
	T tmp;
	if (a > b) {
		tmp = b;
		b = a;
		a = tmp;
	}
}

int main()
{
	int A[20] = { 1, 4, 6, 23, 5, 2, 7, 9, 4, 40 ,56, 25, 99, 107, 42, 84, 57, 11, 62, 23 };
	for (int i = 0; i < 20; i++) {
		cout << A[i] << " ";
	}
	cout << endl;

	ShellSort_1(A, 20);
	for (int i = 0; i < 20; i++) {
		cout << A[i] << " ";
	}
	cout << endl;
    return 0;
}