快速排序c++

#include<iostream>
using namespace std;
int Partition(int a[], int left, int right)
{
	int temp = a[left];
	while (left < right)
	{
		while (left<right && a[right]>temp)right--;
		a[left] = a[right];
		while (left < right && a[left] <= temp)left++;
		a[right] = a[left];
	}
	a[left] = temp;
	return left;
}
void quickSort(int a[],int left,int right)
{
	if (left < right)
	{
		int pos = Partition(a, left, right);
		quickSort(a,left,pos-1);
		quickSort(a, pos +1,right);
	}
}
int main()
{
	int a[11] = { 35,18,16,72,24,65,12,88,46,28,55 };
	quickSort(a, 0, 10);
	for (int i = 0; i < 11; i++)
	{
		cout << a[i] << endl;
	}
	return 0;
}