## Heapsort is a nice algorithm, but in practice Quicksort (coming up) usually wins

## But the heap data structure is incredibly useful for implementing priority queues

- A data structure for maintaining a set S of elements, each with an associated value or key
- Supports the operations Insert(), Maximum(), and ExtractMax()
- What might a priority queue be useful for?

Previous slide | Next slide | Back to first slide | View graphic version |