Merge sort

A fast sort that splits the row in half, sorts each half, then merges the two ordered halves. It keeps ties in order and costs about n log n.

Back to the glossary