冒泡 快排 堆 插入几种常见排序的c++实现

#include<iostream>
#include<stdio.h>
#include<vector>
#include<map>
#include<algorithm>


using namespace std;

void bubble_sort(int *arr, int n){
	for (int i = 0; i < n - 1; i++)
	    for (int j = 0; j < n - 1 - i; j++)
		    if (arr[j]>arr[j + 1])
			    swap(arr[j],arr[j+1]);
}


void quick_sort(int *a, int left,int right){
	if (left >= right) return;

	int i = left;
	int j = right;
	int temp = a[right];
	
	while (i != j){
		while (i < j&&a[i] <= temp) i++;
		if (i < j) a[j] = a[i];
		while (i < j&& a[j] >= temp) j--;
		if (j>i) a[i]=a[j];
	}
	a[i] = temp;
	quick_sort(a, left, i - 1);
	quick_sort(a, i + 1, right);
}

void Merge(int a[], int left, int mid, int right){
	int len = right - left + 1;
	vector<int> tmp(len);
	int k = 0;
	int i = left;
	int j = mid+1;
	while (i <= mid&&j <= right)
		tmp[k++] = a[i] <= a[j] ? a[i++] : a[j++];
	while (i <= mid)
		tmp[k++] = a[i++];
	while (j <= right)
		tmp[k++] = a[j++];
	for (int i = 0; i < len; i++)
		a[left+i] = tmp[i];
}
void merge_sort(int a[], int left, int right){
	if (left == right) return;
	int mid = (left + right) / 2;
	merge_sort(a, left, mid);
	merge_sort(a, mid + 1, right);
	Merge(a, left, mid, right);
}




void insert_sort(int *a, int n){
	int tmp;
	for (int i = 1; i < n; i++){
		tmp = a[i];
		int j;
		for (j = i-1; j >=0&&tmp<a[j]; j--)
			a[j + 1] = a[j];
		a[j + 1] = tmp;
	}
}


void create_heap(int a[], int i, int n){
	for (; i >= 0; i--){
		int left = 2*i + 1;
		int right = 2 * i + 2;
		int j = 0;
		if (right < n)
			a[left] > a[right] ? j = left : j = right;
		else
			j = left;
		if (a[j] > a[i])
			swap(a[j], a[i]);
	}
}
void heap_sort(int a[],int n){
	create_heap(a, n / 2 - 1, n);
	for (int i = n-1; i >=0 ; i--){
		swap(a[i], a[0]);
		create_heap(a, i / 2 - 1, i);
	}
}



int arr[] = { 10, 6, 11, 0, 6, 5, 2, 3, 8, 7, 4, 9, 1 };
int main(){
	
	int n = sizeof(arr) / sizeof(int);
	//heap_sort(arr, n);
	quick_sort(arr, 0, n-1);
	printf("排序后的数组为：\n");
	for (int j = 0; j<n; j++)
		printf("%d ", arr[j]);
	printf("\n");
	while (1);
	return 0;
}