排序算法之快速排序

#include<iostream>
#include<stdio.h>
using namespace std;

void kuaisupaixu(int a[],int low,int high)
{

    int i=low,j=high;
    if(high>low)
    {
        int temp=a[low];
        while(i<j)
        {
            while(i<j&&a[j]>=temp)j--;
            if(a[j]<temp)
            {
                a[i]=a[j];
                i++;
            }
            while(i<j&&a[i]<=temp)i++;
            if(a[i]>temp)
            {
                a[j]=a[i];
                j--;
            }
        }
        a[i]=temp;
        kuaisupaixu(a,low,i-1);
        kuaisupaixu(a,i+1,high);
    }
}
int main()
{

    int a[9]= {4,6,7,8,1,3,2,9,5};
    int len=9;
    for(int i=0; i<9; i++)
    {
        cout<<a[i];
    }
    cout<<endl;
    kuaisupaixu(a,0,8);
      for(int i=0; i<9; i++)
    {
        cout<<a[i];
    }

}