Skip to content

Glossary: Data Structures and Algorithms

Merge sort

Also written: merge

A sort that splits the list in half, sorts each half recursively, then merges the two sorted halves. It runs in O(n log n).

Where the book teaches it

Related terms

Divide and conquerInsertion sortStable sortRecursion