Question

Explain what is heap sort?

​

Answer 1

Answer:

Heapsort is a comparison-based sorting algorithm that uses a binary heap data structure. ... The binary heap data structure allows the heapsort algorithm to take advantage of the heap's heap properties and the heapsort algorithm makes use of the efficient running time for inserting to and deleting from the heap.

Answer 2

Explanation:

A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. Repeat steps 1 and 2 until there are no more items left in the heap sorts