常用排序算法C++代码总结

常用排序算法总结，包括冒泡排序、选择排序、插入排序、希尔排序、快速排序、归并排序、堆排序等，C++代码实现，简洁易懂。

void Swap(int A[], int i, int j) //交换数组中两个元素
{
	int temp = A[i];
	A[i] = A[j];
	A[j] = temp;
}

1、冒泡排序

void BubbleSort(int A[], int n)
{
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = 0; j < n - 1 - i; j++)
		{
			if (A[j] > A[j + 1])
				Swap(A, j, j + 1);
		}
	}
}

2、选择排序

void SelectionSort(int A[], int n)
{
	for (int i = 0; i < n - 1; i++)
	{
		int min = i;
		for (int j = i + 1; j < n; j++)
		{
			if (A[j] < A[min])
				min = j;
		}
		if (min != i) Swap(A, min, i);
	}
}

3、插入排序

void InsertionSort(int A[], int n)
{
	for (int i = 1; i < n; i++)
	{
		int temp = A[i], j = i - 1;
		while (j >= 0 && A[j] > temp)
		{
			A[j + 1] = A[j];
			j--;
		}
		if (j != i - 1) A[j + 1] = temp;
	}
}

4、希尔排序

void ShellSort(int A[], int n)
{
	int gap = 0;
	while (gap <= n) gap = 3 * gap + 1; //生成初始增量
	while (gap >= 1)
	{
		for (int i = gap; i < n; i++)
		{
			int j = i - gap;
			int temp = A[i];
			while (j >= 0 && A[j] > temp)
			{
				A[j + gap] = A[j];
				j = j - gap;
			}
			A[j + gap] = temp;
		}
		gap = (gap - 1) / 3; //递减增量
	}
}

5、快速排序

void QuickSort(int A[], int low, int high)
{
	int pivotkey, i, j;
	pivotkey = A[low];
	i = low;
	j = high;
	if (low > high) return;
	while (i != j)
	{
		while (A[j] >= pivotkey && i < j) j--;
		while (A[i] <= pivotkey && i < j) i++;
		if (i < j) Swap(A, i, j);
	}
	A[low] = A[i];
	A[i] = pivotkey;
	QuickSort(A, low, i - 1);
	QuickSort(A, i + 1, high);
}

6、归并排序

void Merge(int A[], int reg[], int start, int end)
{
	if (start >= end) return;
	int len = end - start, mid = (len / 2) + start;

	//分成两部分
	int start1 = start, end1 = mid;
	int start2 = mid + 1, end2 = end;
	//然后合并
	Merge(A, reg, start1, end1);
	Merge(A, reg, start2, end2);

	int k = start;
	//两个序列一一比较,哪的序列的元素小就放进reg序列里面,然后位置+1再与另一个序列原来位置的元素比较
	//如此反复,可以把两个有序的序列合并成一个有序的序列
	while (start1 <= end1 && start2 <= end2)
		reg[k++] = A[start1] < A[start2] ? A[start1++] : A[start2++];

	//然后这里是分情况,如果A2序列的已经全部都放进reg序列了然后跳出了循环
	//那就表示A序列还有更大的元素(一个或多个)没有放进reg序列,所以这一步就是接着放
	while (start1 <= end1)
		reg[k++] = A[start1++];
	//这一步和上面一样
	while (start2 <= end2)
		reg[k++] = A[start2++];

	//把已经有序的reg序列放回A序列中
	for (k = start; k <= end; k++)
		A[k] = reg[k];
}

void MergeSort(int A[], int n)
{
	//创建一个同样长度的序列,用于临时存放
	int *reg = new int[n];
	Merge(A, reg, 0, n - 1);
}

7、堆排序

void MaxHeapBuild(int A[], int n, int parent) //堆排序大顶堆建堆
{
	int leftChild, rightChild, maxIdx;	
	leftChild = 2 * parent + 1;
	rightChild = 2 * parent + 2;
	maxIdx = parent;
	if (leftChild < n && A[leftChild] > A[maxIdx]) maxIdx = leftChild;
	if (rightChild < n && A[rightChild] > A[maxIdx]) maxIdx = rightChild;
	if (maxIdx != parent)
	{
		Swap(A, parent, maxIdx);
		MaxHeapBuild(A, n, maxIdx);
	}
}

void HeapSort(int A[], int n)
{
	for (int i = n / 2 - 1; i >= 0; i--) MaxHeapBuild(A, n, i);
	for (int i = n - 1; i >= 1; i--)
	{
		Swap(A, i, 0);
		MaxHeapBuild(A, i, 0);
	}
}