Page 130 - Data Structures Handout_Neat

Example: Quick Sort in C++

10.3.3 Heap Sort (Using Priority Queues)

Heap Sort uses a binary heap data structure. It first builds a max-heap from the array,

then repeatedly extracts the maximum element and places it at the end of the array. Heap
Sort guarantees ( log⁡ )performance and does not require extra memory, but it is not

130