快速排序源代码--QuickSort

#include <iostream>
using namespace std;
class QuickSort{
    float *Array;
    const int Length;
public:
    QuickSort(int size);
    void Initital();
    ~QuickSort();
    int Partions(int low,int high);
    void Quick(int low,int high);
    void Sort();
    void Print();
};
QuickSort::QuickSort(int size):Length(size){
}
void QuickSort::Initital(){
    Array = new float[Length];
    cout<<"Please input the Array what you want to oder"<<endl;
    int it=0;
    for( ; it<Length; it++ ){
        cin>>Array[it];
    }
}
int QuickSort::Partions(int low,int high){
    int j;
    float temp=Array[high];
    int i=low-1;
    for(j=low;j<high;j++){
        if(Array[j]<=temp){