快速排序c++

#include <iostream>

using namespace std;

void QuickSort(int arry[],int L,int R)
{
	if(L>=R)
		return ;
	int left=L,right=R;
	int pivot = arry[left];
	while(left<right){
		while(left<right && arry[right]>=pivot)
		{
			right--;
		}
		if(left<right)
		{
			arry[left]=arry[right];
		}
		while(left<right && arry[left]<=pivot){
			left++;
		}
		if(left<right){
			arry[right]=arry[left];
		}
		if(left>=right){
			arry[left]=pivot;
		}
	}
	QuickSort(arry,L,right-1);
	QuickSort(arry,right+1,R);
}
int main()
{
	int arry[]={5,3,8,6,2,9};
	QuickSort(arry,0,sizeof(arry)/sizeof(int)-1);
	for(int i=0;i<sizeof(arry)/sizeof(int);i++)
		cout<<arry[i]<<" ";
	cout<<endl;
    
}