实验内容：
用任意一种排序方式给出n个整数按升序排序后的结果（名次排序、及时终止的选择排序、及时终止的冒泡排序、插入排序）

样例：
输入
5
5 3 4 2 1
输出
1 2 3 4 5

代码实现：

#include<iostream>
#include<iterator>
using namespace std;

template<class T>
class Sort {

public:
	void selectionSort(T a[], int n) {//及时终止的选择排序
		bool sorted = false;
		for (int size = n; (!sorted)&&(size > 1); size--) {
			int indexOfMax = 0;
			sorted = true;
			for (int i = 1; i < size; i++)
				if (a[indexOfMax] <= a[i]) indexOfMax = i;
				else sorted = false;
			swap(a[indexOfMax], a[size - 1]);
		}
		for (int j = 0; j <n; j++) {//输出
			cout << a[j] << " ";
		}
	}

	bool bubble(T a[], int n) {//及时终止的冒泡排序//主体部分
		bool swapped = false;
		for(int i=0;i<n-1;i++)
			if (a[i] > a[i + 1]) {
				swap(a[i], a[i + 1]);
				swapped = true;
			}
		return swapped;
	}

	void bubbleSort(T a[], int n) {//冒泡排序调用部分
		for (int i = n; i > 1 && bubble(a, i); i--);
		for (int j = 0; j < n; j++) {//输出
			cout << a[j] << " ";
		}
	}

	void insertionSort(T a[], int n) {//插入排序
		for (int i = 1; i < n; i++) {
			T t = a[i];
			int j;
			for (j = i - 1; j >= 0 && t < a[j]; j--)
				a[j + 1] = a[j];
			a[j + 1] = t;
		}
		for (int j = 0; j < n; j++) {//输出
			cout << a[j] << " ";
		}
	}

	void rearrange(T a[], int n, int r[]) {//名次排序
		T* u = new T[n];
		for (int i = 0; i < n; i++)
			u[r[i]] = a[i];
		for (int i = 0; i < n; i++)
			a[i] = u[i];
		for (int j = 0; j < n; j++) {//输出
			cout << a[j] << " ";
		}
		delete[] u;
	}
private:
};

int main() {
	int n;
	cin >> n;
	int* a = new int[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	Sort<int > b;
	//b.insertionSort(a, n);
	//b.bubbleSort(a, n);
	//b.selectionSort(a, n);

	int c[] = { 4,3,2,1,0 };//对应5 4 3 2 1 的名次，测试时应输入5 4 3 2 1
	b.rearrange(a, n, c);

	delete[] a;
	return 0;
}