In this c sample program compile the following codes and see the output

/*
PROG: butter
LANG: C++
*/

download c_heap_sort
//In the name of God
#include
#include
#include
using namespace std;

const int P = 800 + 10, N = 500 + 10, inf = P * N * 225;
int h[P], nh = 0, ver[P], ind[P], t[30], hh;
vector v[P];

inline void my_swap (int x, int y) {
swap (ver[x], ver[y]);
swap (ind[ ver[x] ], ind[ ver[y] ]);
swap (h[x], h[y]);
}

//x == index
void bobble_up (int x) {
if (x != 1 && h[x] h[x*2] && x*2 h[x*2 + 1] && x*2+1 > x) {
insert_key (x);
t[hh++] = x;
cerr }
cerr sort (t, t+hh);
/*for (int i=1; i
cerr cerr for (int i=0; i
cerr cerr while(nh)
cerr cerr return 0;
}

copy the code above
The end of the c sample program
for more samples see other posts in the blog
please leave messages and comment below
;>+>