快速排序

#include <iostream>
using namespace std;
int split(int *A,int w);
void quicksort(int *A,int low,int high);
int temp;
int main()
{
    int A[10] = {214,3636,22,55,37,45,12,54,264,52};
	int num;
	if(A[0]<A[(9+0)/2])
		temp=A[0];
	else
		temp=A[(9+0)/2];
	if(temp>A[9])
		temp=A[9];
	quicksort(A,0,9);
	
    for(int i=0;i<9;i++)
		cout<<A[i]<<"  ";
	cout<<endl;

	return 0;
}

int split(int *A,int low,int high,int w)
{
 int i=low,temp;
 int x=A[low];
 for(int j=low+1;j<=high;j++)
 {
   if(A[j]<=x)
   {
      i=i+1;
	  if(i!=j)//if i!=j 互换A[i]和A[j]
	  {
		  temp=A[i];
		  A[i]=A[j];
		  A[j]=temp;
	  }
   }
 }
 //互换A[low]和A[i],因为前面将A[i]与A[j]互换了，所以A[i](原为A[j])的值<=x,则互换A[low](即x)和A[i]
 temp=A[i];
 A[i]=A[low];
 A[low]=temp;
 return i;
}

void quicksort(int *A,int low,int high)
{
 if(low<high)
 {
    temp=split(A,low,high,temp);
	quicksort(A,low,temp-1);
	quicksort(A,temp+1,high);
 }
}