This file explains the nitty-gritty behind how CPython's sorting algorithms are implemented, and compares it to previous implementations. The last time Timsort

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