This program illustrates the use of the STL sort_heap() algorithm (extended
version) to sort a (minimum) heap of integers into descending order. In this
case, the built-in predicate functor greater<int>() is used to order the
values in the vector which holds the heap.
Press Enter to continue ...

Here are the values in the heap:
1 2 25 7 3 100 36 19 17
Press Enter to continue ...

Now we sort these values into descending order.
Press Enter to continue ...

Here are the results:
100 36 25 19 17 7 3 2 1
Press Enter to continue ...