int main(int argc, char* argv[])
{
int dummy;
Heap<int> hp;
hp.Insert(10).Insert(6).Insert(20).Insert(30).Insert(25).Insert(3).Insert(8);
cout << "Heap elements: " << hp << endl;
hp.PrintTreeVertically(cout, 64);
cout << endl << "Heap elements on delete: ";
while (!hp.IsEmpty()) {
hp.DeleteMin(dummy);
cout << dummy << ", ";
}
cout << endl;
// Heap sort
// In this mechanism/implementation, note that:
// Descending sort by using Min-Heap, while ascending sort should use Max-Heap
int a[] = { 1, 3, 4, 2, 5, 9, 3, 6, 7, 9, 4, 8 };
#define ELEM_COUNT(a) (sizeof(a) / sizeof(a[0]))
Heap<int>::Sort(a, ELEM_COUNT(a));
cout << "Sort array descending: ";
for (int i = 0; i < ELEM_COUNT(a); i++) {
cout << a[i] << ", ";
}
cout << endl;
return 0;
}
