Heap Sort

Heap Sort
An Introduction

Prof. David Bernstein
James Madison University

Computer Science Department

bernstdh@jmu.edu

The Algorithm

Some Observations

A Limitation:
- Heap sort requires "random access" to all elements
- Hence, it is really only appropriate for sorting arrays
Efficiency:
- You should be able to determine the bound on the worst case time efficiency