快速排序的C语言实现

#include<iostream>
using namespace std;

int  Partition(int a[],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];
    }
    a[low] = t;
    return low;
}

void MySort(int a[],int low, int high)
{
    int tmp,i;
    if(low<high){
        tmp = Partition(a,low,high);
        MySort(a,low,tmp-1);
        MySort(a,tmp+1,high);
    }
}
int main()
{
    int i, a[10];
    for(i=0;i<10;i++)
        cin>>a[i];
    MySort(a,0,9);
    for(i=0;i<10;i++)
        cout<<a[i]<<" ";

}