Skip to content

Glossary: Data Structures and Algorithms in C++

Merge sort

Also written: merge

Split the list in half, sort each half recursively, then merge the sorted halves. It is O(n log n) and stable.

Where the book teaches it

Related terms

Divide and conquerStable sortInsertion sort