Ideas & society2024 · shared on Hacker News
Insertion Sort is O(n log n) [pdf] (2004)
Research PDF · needs verificationExplore Insertion Sort is O(n log n) [pdf] (2004), its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Yisaacfrond ·
New book-sorting algorithm almost reaches perfection
258 points54 comments
Ypcfwik ·
Insertion Sort is O(n log n) [pdf] (2004)
3 points1 comments