实验十二 内部排序比较（第16周）

实验目的：

  通过上机实验对各种内部排序方法进行比较。

实验内容与要求：

⑴现希尔排序、快速排序、堆排序这三种内部排序方法；

  ⑵生成随机数以构造待排表；

  ⑶记录运行结果并加以分析。

#include<iostream>
#include<iomanip>
#include<windows.h>
using namespace std;
const int length = 10;		//排序数量
const int Size = 4;			//希尔排序增量个数

//生成任意类型，任意区间的随机数
template<typename T>
T randT(T Lower, T Upper)
{
	T temp;
	if (Lower > Upper)
	{
		temp = Upper;
		Upper = Lower;
		Lower = temp;
	}
	temp = static_cast<double>(Upper - Lower);	//避免数据丢失或溢出
	return rand() / (double)RAND_MAX * temp + Lower;
}

template<class T>
class Sort {
private:
	T* table = new T[length]();
public:
	Sort();
	~Sort();
	void refresh_table();	//刷新查找表
	void print_table();
	void Hill_sort();		//希尔排序
	void Quick_sort();		//快速排序
	void quick(T *q,int low,int high);
	int Partition(T *&q,int low,int high);	
	void Heap_sort();		//堆排序
	void heap_adjust(T* &h,int s,int m);	
	void print(T* q);		//打印中间过程
	
};

template<class T>
Sort<T>::Sort()
{
	srand(GetTickCount64());	//生成随机数种子
	for (int i = 0; i < length; i++) {
		table[i] = randT<T>(0, 100);
	}
}

template<class T>
Sort<T>::~Sort()
{
	delete[]table;
}

template<class T>
void Sort<T>::refresh_table()
{
	srand(GetTickCount64());	//生成随机数种子
	for (int i = 0; i < length; i++) {
		table[i] = randT<T>(0, 100);
	}
}

template<class T>
void Sort<T>::print_table()
{
	cout << endl << "查找表为:" << endl;
	cout.setf(ios::left);
	for (int i = 0; i < length; i++) {
		if (i % 10 == 0 && i != 0)cout << endl;
		cout << setw(10) << table[i] << " ";
	}
	cout << endl;
	for (int i = 0; i < 115; i++)cout << "-";
	cout << endl ;
}

template<class T>
void Sort<T>::Hill_sort()
{
	T* h = new T[length + 1];
	for (int i = 0; i < length; i++)h[i + 1] = table[i];
	int* d = new int[Size];
	//增量取递增的素数,且最少相隔1
	d[Size - 1] = 1;
	int m = Size - 2;
	int z = 1;	//最后一个增量
	while (m >= 0) {
		for (int i = 2; i <= z; i++) {
			if (z % i == 0 && i != z) {
				z++;
				i = 2;
			}
			else if (z % i == 0 && i == z && z > d[m + 1] + 1) {
				d[m] = z;
				m--;
				z++;
			}
		}
		z++;
	}
	//计算排序用时
	LARGE_INTEGER BegainTime;
	LARGE_INTEGER EndTime;
	LARGE_INTEGER Frequency;
	QueryPerformanceFrequency(&Frequency);
	QueryPerformanceCounter(&BegainTime);
	cout << endl << "希尔排序" << endl;
	//希尔排序
	for (int n = 0; n < Size; n++) {
		cout << "增量为" << d[n] << "时" << endl;
		for (int i = 1; i < length + 1; i++) {
			for (int j = d[n] + i; j < length + 1; j += d[n]) {
				if (h[j] < h[j-d[n]]) {
					h[0] = h[j];
					h[j] = h[j - d[n]];
					int k = j - d[n];
					while (k > d[n] && h[k-d[n]] > h[0]) {
						h[k] = h[k - d[n]];
						k -= d[n];
					}
					h[k] = h[0];
					print(h);
				}
			}
		}
	}

	QueryPerformanceCounter(&EndTime);
	cout << endl << "结果:" << endl;
	print(h);
	cout << "用时:" << (float)(EndTime.QuadPart - BegainTime.QuadPart) / Frequency.QuadPart * 1000 << "ms" << endl << endl;
	delete[]d;
	delete[]h;
}

template<class T>
void Sort<T>::Quick_sort()
{
	T* q = new T[length + 1]();
	for (int i = 0; i < length; i++)q[i + 1] = table[i];
	//计算排序用时
	LARGE_INTEGER BegainTime;
	LARGE_INTEGER EndTime;
	LARGE_INTEGER Frequency;
	QueryPerformanceFrequency(&Frequency);
	QueryPerformanceCounter(&BegainTime);
	cout << endl << "快速排序" << endl;
	//快速排序
	quick(q, 1, length);

	QueryPerformanceCounter(&EndTime);
	cout << endl << "结果:" << endl;
	print(q);
	cout << "用时:" << (float)(EndTime.QuadPart - BegainTime.QuadPart) / Frequency.QuadPart * 1000 << "ms" << endl << endl;
	delete[]q;
}

template<class T>
void Sort<T>::quick(T *q,int low,int high)
{
	if (low < high) {
		int	p = Partition(q, low, high);
		print(q);
		quick(q, low, p - 1);
		quick(q, p + 1, high);
	}
}

template<class T>
int Sort<T>::Partition(T *&q,int L,int H)
{
	q[0] = q[L];
	while (L < H) {
		while (L < H && q[H] >= q[0])H--;
		q[L] = q[H];
		while (L < H && q[L] <= q[0])L++;
		q[H] = q[L];
	}
	q[L] = q[0];
	return L;
}

template<class T>
void Sort<T>::Heap_sort()
{
	T* h = new T[length + 1]();
	for (int i = 0; i < length; i++)h[i + 1] = table[i];
	cout << endl << "堆排序" << endl;
	//计算排序用时
	LARGE_INTEGER BegainTime;
	LARGE_INTEGER EndTime;
	LARGE_INTEGER Frequency;
	QueryPerformanceFrequency(&Frequency);
	QueryPerformanceCounter(&BegainTime);
	for (int i = length / 2; i >= 1; --i) {
		heap_adjust(h, i, length);
	}
	for (int i = length; i > 1; --i) {
		print(h);
		h[0] = h[1];
		h[1] = h[i];
		h[i] = h[0];
		heap_adjust(h, 1, i - 1);
	}

	QueryPerformanceCounter(&EndTime);
	cout << endl << "结果:" << endl;
	print(h);
	cout << "用时:" << (float)(EndTime.QuadPart - BegainTime.QuadPart) / Frequency.QuadPart * 1000 << "ms" << endl << endl;
	delete[]h;
}

template<class T>
void Sort<T>::heap_adjust(T *&h,int s,int m)
{
	h[0] = h[s];
	int k = s;
	int j = 2 * k;
	while (j <= m) {
		if (h[j] > h[0]) {
			if (j<m && h[j + 1]>h[j]) {
				h[k] = h[j + 1];
				h[j + 1] = h[0];
				k = j + 1;
			}
			else {
				h[k] = h[j];
				h[j] = h[0];
				k = j;
			}
		}
		else {
			if (j < m && h[j + 1] > h[0]) {
				h[k] = h[j + 1];
				h[j + 1] = h[0];
				k = j + 1;
			}
			else {
				break;
			}
		}
		j = 2 * k;
	}
}

template<class T>
void Sort<T>::print(T* q)
{
	cout.setf(ios::left);
	for (int i = 1; i < length + 1; i++) {
		if ((i - 1) % 10 == 0 && (i - 1) != 0)cout << endl;
		cout << setw(10) << q[i] << " ";
	}
	cout <<"#";
	cout << endl;
}

void show() {
	cout << "---内部排序比较---" << endl;
	cout << "1.刷新随机表" << endl;
	cout << "2.排序" << endl;
	cout << "0.退出" << endl;
}

int main() {
	int n;
	Sort<int>s;
	show();
	s.print_table();
	while (1) {
		cin >> n;
		for (int i = 0; i < 115; i++)cout << "-";
		if (n == 1) {
			s.refresh_table();
			s.print_table();
		}
		else if (n == 2) {
			s.Hill_sort();
			s.Quick_sort();
			s.Heap_sort();
			for (int i = 0; i < 115; i++)cout << "-";
		}
		else if (n == 0)break;
		else {
			cout << "error" << endl;
		}
	}
}