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

• Heap sort works by building a binary heap from the array to be sorted.

• The largest element is then swapped with ...read more