This is a pure function.

Deletes an element from the given heap.

This is not a pure function because it modified the array each time.

Definition of almost-a-heap.

Inserts the given element into the given heap and returns the modified heap.

asymptotic lower bound is (n Log n)theta is (n + (n log n))asymptotic upper bound is (n)breaking point is assumed to be an ordered set of integers from low to high.

i int - the index in the given heap of the parent of element i.