关于几个排序(C++)

1.快速排序

#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int arr[N];
void quick_sort(int l, int r, int arr[])//快速排序
{
	if (l >= r)return;
	int x = arr[l + r >> 1], i = l - 1, j = r + 1;
	while (i < j)
	{
		do i++; while (arr[i] < x);
		do j--; while (arr[j] > x);
		if (i < j){ int t = arr[i]; arr[i] = arr[j]; arr[j] = t; }
	}
	quick_sort(l, j, arr);
	quick_sort(j + 1, r, arr);
}
//quick_sort(0, n - 1, arr);

2.归并排序

#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int arr[N];
int temp[N];
void merge_sort(int l, int r, int arr[])//归并排序
{
	if (l >= r)return;
	int mid = l + r >> 1;
	merge_sort(l, mid, arr);
	merge_sort(mid + 1, r, arr);
	int k = 0, i = l, j = mid + 1;
	while (i <= mid&&j <= r)
	{
		if (arr[i] <= arr[j])temp[k++] = arr[i++];
		else temp[k++] = arr[j++];
	}
	while (i <= mid)temp[k++] = arr[i++];
	while (j <= r)  temp[k++] = arr[j++];
	for (i = l, j = 0; i <= r; i++, j++)arr[i] = temp[j];
}
//merge_sort(0, n - 1, arr);

3.插入排序

#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int arr[N];
int temp[N];
void insert_sort(int n, int arr[])//插入排序
{
	for (int i = 1; i < n; i++)
	{
		if (arr[i]<arr[i - 1])
		{
			int temp = arr[i];
			int j = 0;
			for (j = i - 1; j >= 0 && arr[j]>temp; j--)
				arr[j + 1] = arr[j];
			arr[j + 1] = temp;
		}
	}
}
//insert_sort(n, arr);