bubblesort.h

改进的排序算法分析程序

template
< class T >
void BubbleSort(T a[], int N, int& KCN, int& RMN)
{
	KCN = 0;
	RMN = 0;

	bool exchange = true;

	for (int i = 1; i < N && exchange; i++)
	{
		for (int j = N - 1; j >= i; j--)
		{
			exchange = false;

			if (++KCN && a[j - 1] > a[j])
			{
				swap(a[j - 1], a[j]);
				exchange = true;
				RMN += 3;
			}
		}
	}
}