Algorithms to Live By: The Computer Science of Human Decisions

by Brian Christian

The power of Mergesort comes from the fact that it indeed ends up with a complexity between linear and quadratic time—specifically, O(n log n), known as “linearithmic” time.