This file explains the nitty-gritty behind how CPython's sorting algorithms are implemented, and compares it to previous implementations.<p>The last time Timsort was posted on HN was here [0] and here [1], and neither article seemed to have similar detail.<p>[0] <a href="https://news.ycombinator.com/item?id=27823180" rel="nofollow">https://news.ycombinator.com/item?id=27823180</a><p>[1] <a href="https://news.ycombinator.com/item?id=21196555" rel="nofollow">https://news.ycombinator.com/item?id=21196555</a> (the article for this link is now a 404)