Skip to content

Glossary: Data Structures and Algorithms in Go

Heap sort

An O(n log n) sorting method based on a heap. Go's built-in sort falls back to it in bad cases.

Where the book teaches it

Related terms

HeapPattern-defeating quicksortQuicksort