Heap Applications
Heaps are favorite data structures for many applications.
Heap sort:
One of the best sorting methods being in-place and with no quadratic worst case scenarios.
Selection algorithms:
Finding the min, max or both of them, median or even any k-th element in sublinear time can be done dynamically with heaps.
Graph algorithms:
By using heaps as internal traversal data structures, run time will be reduced by an order of polynomial. Examples of such problems are Prim's minimal spanning tree algorithm and Dijkstra's shortest path problem.
