简简单单的快速排序

#include <iostream>

using namespace std;

void Qsort(int a[],int low,int high)
{
    if(low>high){
        return;
    }
    int key=a[low];
    int first=low,last=high;
    while(first<last)
    {
        while(first<last && a[last]>=key)
        {
            last--;
        }
        a[first]=a[last];
        while(first<last && a[first]<=key)
        {
            first++;
        }
        a[last]=a[first];
    }
    a[first]=key;
    Qsort(a,low,first-1);
    Qsort(a,first+1,high);
}

int main()
{
    int a[]={8,5741,54,147,21,71,274,414,414,71,15,74};
    Qsort(a,0,sizeof(a)/sizeof(a[0])-1);
    for(int i=0;i<sizeof(a)/sizeof(a[0]);i++){
        cout<<a[i]<<' ';
    }
    return 0;
}