Procedures in a heap

Take quiz & check grades

Fixes the heap A at element index i. The subtree starting at A[i] will be fixed as a heap.

Builds a heap A. A contains the elements in arbitrary order.

Extracts the maximum element from the heap

Inserts an element into the heap