快速排序

#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[]={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;
	 }
	 system("pause");
	 return 0;
 }