堆排序

#include <iostream>
#include <stdio.h>
using namespace std;
int heep[] = {2, 5, 3, 7, 4, 9, 1, 6, 8, 10};
int n = 10;

void heep_print(int cnt){
    printf("\n%d:\n", cnt);
    for(int i = 0; i < n;i++){
        printf("%d ", heep[i]);
    }

}

void build_heep(int r, int num){

    int lc = (r << 1) + 1;
    int c = lc;

    if(lc < num){
        int rc = lc + 1;
        if(rc < num){
            if(heep[lc] > heep[rc]){
               c = rc;
            }
        }
        if(heep[r] > heep[c]){
            swap(heep[r], heep[c]);
            build_heep(c, num);
        }
    }
}

void heep_sort(){
    for(int i = n-1; i>= 0; i--){
        build_heep(i, n);
    }

    int k = n - 1;

    printf("%d ", heep[0]);

    for(int i = 1; i < n; i++, k--){
        swap(heep[0], heep[k]);
        build_heep(0, k);
        printf("%d ", heep[0]);
    }
}

int main()
{
    heep_sort();
    heep_print(0);
    return 0;
}