插入法建立一个最大堆_逐一插入法

//用插入的方法建堆
#include <iostream>
#define PARENT(i) i>>1
using namespace std;

void MAX_HEAP_INSERT(int A[],int next)
{
    while(1)
    {
        int par=PARENT(next);
        if(next>1 && A[par]<A[next])
        {
            int temp=A[par];
            A[par]=A[next];
            A[next]=temp;
            next=par;
        }
        else break;
    }
}

void BUILD_MAX_HEAP(int A[],int heap_size)
{
    if(heap_size<2)
    {
        if(heap_size==1) return;
        else cout<<"heapsize wrong"<<endl;
    }
    for(int i=2;i<heap_size+1;i++)
    {
        MAX_HEAP_INSERT(A,i);
    }
}

int main(int argc, char *argv[])
{
    int n;
    cin>>n;
    int test[n+1];
    for(int i=1;i<n+1;i++) cin>>test[i];

    BUILD_MAX_HEAP(test,n);

    for(int i=1;i<n+1;i++) cout<<test[i]<<" ";
    cout<<endl;
    cout << "Hello World!" << endl;
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49