快速排序qsort

快速排序

#include <iostream>

using namespace std;
int a[100];
int f(int low,int high)
{
    int t=a[low];
    while(low<high)
    {
        while(low<high && a[high]>=t) high--;
        a[low]=a[high];
        while(low<high && a[low]<=t) low++;
        a[high]=a[low];
    }
    //low==high
    a[low]=t;
    return low;
}
void qsort(int low, int high)
{
    if(low<high)
    {
        int mid =f(low,high);//排好当前这个点(a[low])
        qsort(low,mid-1);//排好这个数左边的数
        qsort(mid+1,high);//排好这个数右边的数
    }
}

int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=1; i<=n; i++)
            cin>>a[i];
        qsort(1,n);

        for(int i=1; i<=n; i++)
            cout<<a[i]<<" ";
        cout<<endl;
    }
    return 0;
}