A stable bottom-up adaptive branchless merge sort - github / HN

see also

• Timsort (2019) - the fastest sorting algorithm you’ve never heard of. Created by Tim Peters for the Python programming language in 2001.