This program illustrates the use of the STL is_heap_until() algorithm from
<algorithm> and the greater<int>() functor from <functional> to find the first
integer that destroys the minimum heap order of a vector of integers.
Press Enter to continue ...
For 3, 8, 5, 9, 12, 14, 6, 17, 15, the sequence is a minimum heap.
For 3, 8, 5, 9, 6, 14, 12, 17, 15, the minimum heap order was destroyed
at element 6.
Press Enter to continue ...