堆排序的時間複雜度是O(nlgn)

#include<iostream>
using namespace std;

int arrs[] = { 23, 65, 12, 3, 8, 76, 345, 90, 21, 75, 34, 61 };
int arrLen = sizeof(arrs) / sizeof(arrs[0]);

//維護堆的性質，保證除了根節點以外的所有節點i滿足A[PARENT(i)]>=A[i]
void adjustHeap(int* arrs, int p, int len)
{

    int rchild = 2 * p + 1;//左孩子
    int
 
 lchild = 2 * p;
    int largest = p;
    if (lchild<len && arrs[lchild]>arrs[p])
        largest = lchild;
    if (rchild<len && arrs[rchild]>arrs[largest])
        largest = rchild;

    if (largest != p)
    {
        swap(arrs[p], arrs[largest]);
        adjustHeap(arrs, largest, len);
    }


}

//建堆
 

void buildHeap(int* arrs, int len)
{
    for (int i = len / 2 - 1; i >= 0; i--)
        adjustHeap(arrs, i, len);

}

//堆排序演算法
void sortHeap(int* arrs, int len)
{
    buildHeap(arrs, arrLen);
    for (int i = len - 1; i >= 0; i--)
    {

        swap(arrs[0], arrs[i]);
        adjustHeap(arrs, 0, i);
    }
}

int
 
 main()
{
    sortHeap(arrs, arrLen);
    for (int i = 0; i < arrLen; i++)
        cout << arrs[i] << endl;

    return 0;
}