MII. HEAP SORT AND MERGE SORT(9) Provide pseudo-code description of Heap Sort. You should provide a sequence of steps that implement enqueuing all elements of an arbitrary list and then dequeuing all elements in an arbitrary list by specifying how insert, delete-max, bubble-up, and bubble-down should be implemented.

Heap Sort, Explained | Built In

Heap Sort Tutorial how to use this in C, C , Java and Python