自己写的堆排序算法，运行出错，条件有限，望指教

#include <iostream>

using namespace std;

void Output(int array[], int nLength) {
    for(int i = 0; i<nLength;i++)
        cout<<array[i]<<" ";
    cout<<endl;
}

class CSorter
{
private:
    inline void HeapAdjust(int array[], int nLength) {
        int j = nLength - 1;
        int *pChild = &array[j];
        int *pParent = &array[j/2-1];
        for(; nLength > 1; nLength--) {
            if(*pChild > *pParent)
                Swap(pChild, pParent);
            pChild--;
            if(j%2 == 1)
                pParent--;
        }
    }

    inline void Swap(int *p1, int *p2) {
        int nTemp = *p1;
        *p1 = *p2;
        *p2 = nTemp;
    }

public:
    void HeapSort(int array[], int nLength) {
        for(; nLength > 1; nLength--) {
            cout<<nLength<<endl;
            HeapAdjust(array, nLength);
            Swap(array, &array[nLength - 1]);
        }
    }
};

int main() {
    CSorter sSorter;
    int array[] = {19,95,10,27,26,9,5};
    cout<<array<<endl;
    sSorter.HeapSort(array, sizeof(array)/sizeof(int));
    cout<<array<<endl;
    return 0;
}