堆(heap)的实现

key concept:

1. left child: 2i+1, right child: 2i+2

2. insert an element: add to the end and move up

3. delete: move the last element to root and move down

/*
PROG: Implement heap (sort)
LANG: C++11 
*/
#include <iostream>
#include <algorithm>

using namespace std;
#define mst(a,b) memset(a,b,sizeof(a))
const int N = 10000;
int heap[N];
int size = 0;

void push(int x){
    int i = size++;
    while(i > 0){
        int p = (i-1)/2;
        if(heap[p] < x)
            break;
        else{
            heap[i] = heap[p];
            i = p;
        }
    }
    heap[i] = x;
}

int pop(){
    int ans = heap[0];
    heap[0] = heap[size-1];
    size--;
    int i = 0;
    int lchild, rchild;
    while(i*2 + 1 < size){
         lchild = heap[i*2+1];
         rchild = heap[i*2+2];
         if(heap[i] <= lchild && heap[i] <= rchild)
             break;
         else {
            if(lchild < rchild){
                swap(heap[i], heap[2*i+1]);
                i = 2*i+1;
            }
            else{
                swap(heap[i], heap[2*i+2]);
                i = 2*i+2;
            }
         }
    }
    return ans;
}


int main()
{
    int n, i;
    int a[8] = {2,1,4,3,5,6,8,7};
    for(i = 0; i < 8; i++){
        push(a[i]);
    }
    for(i = 0; i < 8; i++){
        cout << pop() << endl;
    }

    return 0;
}