409
Marge Sort
(mander.xyz)
A place for majestic STEMLORD peacocking, as well as memes about the realities of working in a lab.

Rules
This is a science community. We use the Dawkins definition of meme.
Tbf, Merge Sort has a Big O of n log (n) in all cases, so it's a pretty mid sorting algorithm in general, but it's conceptually straightforward and easy to explain to newbies.
There's no better big O sorting method for generic lists. Heap sort has better averages but the big O is the same in the end.