有关的插入排序、选择排序、快速排序和冒泡排序C++的实现

#include<iostream>
using namespace std;
void quick(int a[], int low, int high)//快速排序
{
if (low >= high)
return;
int first = low;
int last = high;
int key = a[first];
while (first < last)
{
while (first < last&&a[last] >= key)
{
last--;
}
a[first] = a[last];
while (first < last&&a[first] <= key)
{
first++;
}
a[last] = a[first];
}
a[first] = key;
quick(a, low, first - 1);
quick(a, first + 1, high);
}


void ins(int a[], int n)//插入排序
{
for (int i = 0; i < n - 1; i++)
{
if (a[i + 1] < a[i])
{
int key = a[i + 1];
int k = i+1;
while (key <=a[k]&&k>=0)
{
k--;
}
for (int j = i + 1; j>k+1; j--)
a[j] = a[j-1];
a[k+1] = key;


}
}
}
int max1(int a[], int n, int m)
{
int temp = n;
for (int i = n; i <=m; i++)
{
if (a[i] < a[temp])
temp = i;


}
return temp;
}


void choose(int a[], int n)//选择排序
{
for (int i = 0; i < n; i++)
{
int p = max1(a, i, n - 1);
if (p!= i)
{
int k = a[i];
a[i] = a[p];
a[p] = k;
}
}


}


void bubble(int a[], int n)//冒泡排序
{
for (int i = 0; i < n; i++)
for (int j = i; j < n-1; j++)
{
if (a[j]>a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
int main()
{
int a[] = {1,8,3,4,7};
bubble(a, 5);
/*quick(a,0,5);
ins(a, 5);
choose(a, 5);*/
for (int i = 0; i < 5; i++)
{
cout << a[i] << "\t";
}
return 0;
}