Brandon Skerritt personal blog

Timsort (2019)

by Autumn Skerritt skerritt.blog published 2023-06-208 min read

Timsort: A very fast , O(n log n), stable sorting algorithm built for the real world — not constructed in academia. Timsort is a sorting algorithm that is efficient for real-world data and not created in an academic laboratory. Tim Peters created Timsort for the Python programming language in 2001.

Points

189

HN comments

61

Submissions

1

Cited by

0 commenters

Math & AlgorithmsSoftware Engineering2022

Related posts from the same era

Bicycle

Bartosz Ciechanowski20233,014 points399 commentscited by 14 details

4B If Statements

AAndreas Karlsson20231,518 points645 comments details

Heuristics that almost always work

Scott Alexander20221,000 points520 commentscited by 14 details

New Orleans teenagers found a new proof of the Pythagorean Theorem

Keith McNulty2023949 points251 comments details

Knuth's Art of Computer Programming, V 4B, has gone into print

DDonald Knuth2022940 points513 commentscited by 8 details

Conterintuitive facts in mathematics, CS, and physics

Axis of Ordinary2021936 points323 comments details