Quick Sort

　　

#include <iostream>
using namespace std;
int partition(int *Ary,int low ,int high){
    int temp;
    int pivotkey=Ary[low];
    while(low<high){
        while(low<high && Ary[high]>=pivotkey){
            high--;
        }
        temp=Ary[low];
        Ary[low]=Ary[high];
        Ary[high]=temp;
        while(low<high && Ary[low]<=pivotkey){
            low++;
        }
        temp=Ary[low];
        Ary[low]=Ary[high];
        Ary[high]=temp;
    }
    return low;
}
void Qsort(int *Ary,int low,int high){
    if(low<high){
        int key=partition(Ary,low,high);
        
        Qsort(Ary,low,key-1);
        Qsort(Ary,key+1,high);
    }
    
}
int main(int argc, char *argv[]) {
    
    cout<<"Plz enter 10 numbers which then will be sorted"<<endl;
    int Ary[10] ;
    for (int i=0;i<10;i++){
        cin>>Ary[i];
    }
    int length=(sizeof(Ary)/sizeof(int));
    Qsort(Ary,0,length-1);
    for(int j=0;j<10;j++){
        cout<<Ary[j]<<" ";
    }
    return 0;
    
}