Skip to content

Glossary: Data Structures and Algorithms in Java

heap sort

A sorting algorithm that builds a heap from the items and repeatedly removes the largest or smallest one. It runs in O(n log n) time.

Where the book teaches it

Related terms

heapmerge sort