数据结构_快速排序算法

#include <iostream>
//#include <algorithm>
using namespace std;

/*方法一:
int Partion(int a[],int low,int high)
{
    int pivotkey=a[low];
    while(low<high)
    {
        while(low<high&&a[high]>=pivotkey)
        {
            --high;
        }
        a[low]=a[high];
        while(low<high&&a[low]<=pivotkey)
        {
            ++low;
        }
        a[high]=a[low];
    }
    a[low]=pivotkey;
    return low;
}
*/

//方法二：
int Partion(int a[],int low,int high)
{
    int pivotkey=a[low];
    while(low<high)
    {

         while(low<high&&a[high]>=pivotkey)  //找到后面序列中小的，将其调到前面
        {
            --high;         
        }
        swap(a[low],a[high]);
        while(low<high&&a[low]<=pivotkey)  //找到前面序列中大的，将其调到后面
        {
            ++low;
        }
        swap(a[low],a[high]);
    }
    return low;
}
void QuickSort(int a[],int low,int high)
{


     if(low>=high)
        return ;
        int r=Partion(a,low,high);
        QuickSort(a,low,r-1);
        QuickSort(a,r+1,high);
}
int main()
{

    int n;
    while(cin>>n)
    {
        int *a=new int[n];
        for(int i=0;i<n;i++)
            cin>>a[i];

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