快速排序

快速排序

注意vector作为参数传递时的形式。

void Qsort(vector<int> &a,int low,int high);
int Partiton(vector<int> &a,int low,int high);
void QuickSort(vector<int> &a)    
{
    if(a.size()==0||a.size()==1)
        return;
    int high = a.size()-1;
    Qsort(a,0,high);
}
void Qsort(vector<int> &a,int low,int high)
{
    if(a.empty()||low<0||high>a.size()-1)
        return;
    int pivot;
    //while(low<high){   //不是while循环
    if(low<high){
        pivot = Partiton(a,low,high);
        Qsort(a,low,pivot-1);
        Qsort(a,pivot+1,high);
    }
    
}
int Partiton(vector<int> &a,int low,int high)
{
    if(a.empty()||low<0||high>a.size()-1)
        return -1;
    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;
}

int main()  
{  
        int a[8]={1,4,11,2,7,22,6,72};
        vector<int> aa(a,a+8);
        QuickSort(aa);
        for(int i=0;i<8;i++)
            cout<<aa[i]<<" ";
        system("pause");
        return 0;  }  
}