Max-Heapify

“Fix” heaps that are not in descending order. Work ish the same as Insertion Sort

Kjøretid

$$\begin{array}{rl}T(n)& \le T\left(\frac{2n}{3}\right)+\Theta (1)\\ T(n)& =O(lgn)\end{array}$$