The Peter Principle
applied to Sorting
applied to Sorting
lA heap is a
binary tree structure in which, for each sub-tree, the root is > all elements in that sub-tree.
lIt suffices for each root to be > its children.
l[This is one definition of ÒheapÓ used in CS. The other definition is the area in memory from which storage is allocated dynamically, e.g. when new is called.]