shellsort.h

改进的排序算法分析程序

template
< class T >
void ShellSort(T a[], int N, int& KCN, int& RMN)
{
	KCN = 0;
	RMN = 0;
	
	for (int gap = N / 2; gap; gap = gap / 2)
	{
		for (int i = gap; i < N; i++)
		{
			T temp = a[i];
			RMN++;

			for (int j = i; j >= gap && ++KCN && temp < a[j - gap]; j -= gap)
			{
				a[j] = a[j - gap];
				RMN++;
			}

			a[j] = temp;
			RMN++;
		}
	}
}