This program illustrates the use of the STL sort_heap() algorithm (default
version) to sort a (maximum) heap of integers into ascending order.
Press Enter to continue ...

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

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

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