常用排序算法

常用的排序算法

#include<iostream>
#include<vector>
#include<string>
using namespace std;
//打印排序后数组
void print_sort(vector<int>& arr)
{
	for (int k = 0; k<arr.size(); k++)
	{
		if (k == arr.size() - 1)
			cout << arr[k] << endl;
		else
		{
			cout << arr[k] << " ";
		}
	}
}
//快速排序
void quick_sort(vector<int>& arr, int left, int right)
{
	if (left >= right)
		return;
	int tem = arr[left];
	int i = left;
	int j = right;
	while (i != j)
	{
		while (arr[j] >= tem&&i<j)
			j--;
		while (arr[i] <= tem&&i<j)
			i++;
		if (i != j)
		{
			int k = arr[i];
			arr[i] = arr[j];
			arr[j] = k;
		}
	}
	arr[left] = arr[i];
	arr[i] = tem;
	print_sort(arr);
	quick_sort(arr, left, i - 1);
	quick_sort(arr, i + 1, right);
}
//选择排序
void select_sort(vector<int>& arr)
{
	int min, i,l,j;
	for (i = 0; i < arr.size()-1; i++)
	{
		min = arr[i];
		l = i;
		for (j= i+1; j < arr.size(); j++)
		{
			if (arr[j] < min)
			{
				min = arr[j];
				l = j;
			}
		}
		if (l != i)
		{
			arr[l] = arr[i];
			arr[i] = min;
			
			print_sort(arr);
		}
	}
}
//直接插入排序
void insert_sort(vector<int>&a)
{
	int i, j, temp;
	int n = a.size();
	for (i = 1; i < n; i++)
	{
		temp = a[i];
		for (j = i - 1; j >= 0 && temp < a[j]; j--)
		{
			a[j + 1] = a[j];//后移
		}
		a[j + 1] = temp;
		print_sort(a);
	}
}
//希尔排序
void shell_sort(vector<int>&a)
{
	int i, j, temp,h;
	int len = a.size();
	for (h = len / 2; h > 0; h = h / 2)
	{
		for (i = h; i < len; i++)
		{
			temp = a[i];
			for (j = i - h; j >= 0 && temp < a[j]; j -= h)
			{
				a[j + h] = a[j];
			}
			a[j + h] = temp;
		}
	}
}
//冒泡排序
void buble_sort(vector<int>&a)
{
	int i, j, tmp;
	int n = a.size();
	int flag = 1;
	for (i = 0; i < n-1&&flag; i++)//比较n-1轮
	{
		flag = 0;
		for (j = n-1; j >=i; j--)//每轮比较n-1-i次
		{
			if (a[j+1]<a[j])
			{
				tmp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = tmp;
				flag = 1;
			}
		}
		print_sort(a);
	}
}