数据结构（C++）八大排序统一版

#include<iostream>
using namespace std;
void InsertSort(int a[], int n)
{
	for (int i = 2; i <= n; ++i)
	{
		a[0] = a[i];
		int j = i - 1;
		while (a[0] < a[j])
		{
			a[j + 1] = a[j];
			j--;
		}
		a[j + 1] = a[0];
	}
}
void ShellSort(int a[], int n)
{
	for (int d = n / 2; d >= 1; d /= 2)
	{
		for (int i = d + 1; i <= n; ++i)
		{
			a[0] = a[i];
			int j = i - d;
			while (j > 0 && a[0] < a[j])
			{
				a[j + d] = a[j];
				j -= d;
			}
			a[j + d] = a[0];
		}
	}
}
void BubbleSort(int a[], int n)
{
	int exchange = n;
	while (exchange)
	{
		int bound = exchange;
		exchange = 0;
		for (int i = 1; i < bound; ++i)
		{
			if (a[i] > a[i + 1])
			{
				swap(a[i], a[i + 1]);
				exchange = i;
			}
		}
	}
}
int Partition(int a[], int first, int end)
{
	int i = first;
	int j = end;
	a[0] = a[i];
	while (i < j)
	{
		while (i < j && a[0] <= a[j])
		{
			j--;
		}
		if (i < j)
		{
			a[i] = a[j];
			i++;
		}
		while (i < j && a[0] >= a[i])
		{
			i++;
		}
		if (i < j)
		{
			a[j] = a[i];
			j--;
		}
	}
	a[i] = a[0];
	return i;
}
void QuickSort(int a[], int first, int end)
{
	if (first < end)
	{
		int mid=Partition(a, first, end);
		QuickSort(a, first, mid-1);
		QuickSort(a, mid + 1, end);
	}
}
void SelectSort(int a[], int n)
{
	for (int i = 1; i <= n; ++i)
	{
		int min = 0x3f;
		int k = 0;
		for (int j = i; j <= n; ++j)
		{
			if (min > a[j])
			{
				min = a[j];
				k = j;
			}
		}
		swap(a[i], a[k]);
	}
}
void sift(int a[], int k, int m)
{
	int i = k;
	int j = 2 * i;
	int t = a[i];
	while (j <= m)
	{
		if (j < m && a[j] < a[j + 1])
		{
			j++;
		}
		if (t > a[j])
			break;
		else
		{
			a[i] = a[j];
			i = j;
			j = 2 * i;
		}
	}
	a[i] = t;  
}
void HeapSort(int a[], int n)
{
	for (int i = n / 2; i >= 1; --i)
	{
		sift(a, i, n);
	}
	for (int i = 1; i < n; ++i)
	{
		swap(a[1], a[n - i + 1]);
		sift(a, 1, n - i);
	}
}
void mSort(int a[], int r[], int s, int t)
{
	if (s == t)
		return;
	int mid = (s + t) / 2;
	mSort(a, r, s, mid);
	mSort(a, r, mid + 1, t);
	int i = s;
	int j = mid + 1;
	int k = s;
	while (i <= mid && j <= t)
	{
		if (a[i] <= a[j])
		{
			r[k] = a[i];
			k++;
			i++;
		}
		else
		{
			r[k] = a[j];
			k++;
			j++;
		}
	}
	while (i <= mid)
	{
		r[k] = a[i];
		k++;
		i++;
	}
	while (j <= t)
	{
		r[k] = a[j];
		k++;
		j++;
	}
	for (int i = s; i <= t; ++i)
	{
		a[i] = r[i];
	}
}
void tSort(int a[], int n)
{
	int b[1000];
	memset(b, 0, sizeof(b));
	for (int i = 1; i <= n; ++i)
	{
		b[a[i]]++;
	}
	int count = 1;
	for (int i = 1; i < 1000; ++i)
	{	
		while (b[i])
		{
			a[count++] = i;
			b[i]--;
		}
	}
}
int main()
{
	int n;
	int a[100];
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	//	InsertSort(a, n);
	//	ShellSort(a, n);
	//	BubbleSort(a, n);
	//	QuickSort(a, 1, n);
	//	SelectSort(a, n);
	//  HeapSort(a, n);
	tSort(a, n);
	int r[100];
	mSort(a, r, 1, n);
	for (int i = 1; i <= n; ++i)
	{
		cout << a[i] << " ";
	}
	return 0;
}