Skip to content

Glossary: Data Structures and Algorithms in Java

merge sort

Also written: mergeSort

A recursive sort that splits the list in half, sorts each half, and merges the sorted halves. It is O(n log n) and stable.

Where the book teaches it

Related terms

divide and conquerstable sortTimSortrecursion