Glossary: Data Structures and Algorithms in Go

Merge sort

A divide-and-conquer sort that splits the slice in half, sorts each half recursively and merges the sorted halves. It is O(n log n) and stable.