堆排序的基本实现

class Heap{
private:
    int m[1000];
    int size;
public:
    Heap(int s) :size(s){}
    Heap(int *num, int s) :size(s){ 
        for (int i = 0; i < size; i++)
            m[i] = num[i]; 

    }
    int parent(int i)
    {
        return i / 2;
    }
    int left(int i)
    {
        return i * 2 + 1;
    }
    int right(int i)
    {
        return i * 2 + 2;
    }
    void Heapify(int i)
    {
        int mx = i;
        int l = left(i);
        int r = right(i);
        if (l<size && m[l] > m[mx])
            mx = l;
        if (r<size && m[r] > m[mx])
            mx = r;
        if (i != mx){
            swap(m[mx], m[i]);
            Heapify(mx);
        }
    }

    void BuildHeap()
    {
        for (int i = size / 2; i >= 0; i--)
            Heapify(i);
    }

    void HeapSort()
    {
        cout << "Hello" << endl;
        cout << size << endl;
        while (size > 1)
        {
            cout << "Sorting_out:" << m[0] << endl;
            swap(m[0], m[size - 1]);
            size--;
            Heapify(0);
        }
    }
    int get(int i)
    {
        return m[i];
    }


};