数据结构（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];
	}
}
int main()
{
	int n, a[100];
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	InsertSort(a, n);
	for (int i = 1; i <= n; ++i)
	{
		cout << a[i] << " ";
	}
	return 0;
}

希尔排序

#include<iostream>
using namespace std;
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];
		}
	}
}
int main()
{
	int n, a[100];
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	ShellSort(a, n);
	for (int i = 1; i <= n; ++i)
	{
		cout << a[i] << " ";
	}
	return 0;
}

起泡排序

#include<iostream>
using namespace std;
void BubbleSort(int r[], int n)
{
	int exchange = n;
	while (exchange)
	{
		int bound = exchange;
		exchange = 0;
		for (int j = 1; j < bound; j++)
		{
			if (r[j] > r[j + 1]) // 从小到大排序
			{
				swap(r[j], r[j + 1]);
				exchange = j; // j 是数组最后交换的位置，之后的数组已经排列完整
			}
		}
	}
}
int main()
{
	int n, a[100];
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	BubbleSort(a, n);
	for (int i = 1; i <= n; ++i)
	{
		cout << a[i] << " ";
	}
	return 0;
}

选择排序

#include<iostream>
using namespace std;
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;
			}
		}
		int t = a[i];
		a[i] = a[k];
		a[k] = t;
	}
}
int main()
{
	int n, a[100];
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	SelectSort(a, n);
	for (int i = 1; i <= n; ++i)
	{
		cout << a[i] << " ";
	}
	return 0;
}

堆排序

#include<iostream>
using namespace std;
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);
	}
}
int main()
{
	int n, a[100];
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
	}
	HeapSort(a, n);
	for (int i = 1; i <= n; ++i)
	{
		cout << a[i] << " ";
	}
	return 0;
}