Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Heapsort -- Conceptual
2. Implementing HeapSort
3. Analysis of HeapSort
3.1. Analyzing the loop body
3.2. Completing the analysis
4. Introspective Sort

Priority queues are useful structures in their own right. They often arise in scheduling problems where things must be serviced based upon their importance. We'll also see, in the next section, that they are valuable in many graph manipulation algorithms.

Heaps have another important application besides as implementations of priority queues. They can be used to provide a simple and efficient sorting algorithm.

In the Forum:

(no threads at this time)