Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.

• Heap sort works by first building a heap from the input array.

• Then it repeatedly extracts the maximum element f...read more