Top all-time · #5547
Experimental chill
Personal blog · danlark.orgprogrammingsystems
Experimental chill is a personal blog at danlark.org about programming and systems. Since 2020, 14 different Hacker News readers have linked it 19 times, most often “Miniselect: Practical and Generic Selection Algorithms”. The last post was in 2023, but the archive is still widely read.
Too few sampled comments (3) to say how often HN recommends it.?
Why HN links it
HN readers link Dan Lark's blog for posts on low-level algorithms and performance, including linear-time median finding, the Floyd-Rivest selection approach, binary search and 128-bit division.
Summarised by Claude from a sample of 3 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
About the author
Most-linked posts?
- Miniselect: Practical and Generic Selection Algorithms4 people · 6 mentions · first linked 2020-11-11
- Optimizing 128-bit Division3 people · 4 mentions · first linked 2020-06-15
- Changing std:sort at Google’s scale and beyond2 people · 2 mentions · first linked 2022-04-20
- “csinc”, the AArch64 instruction you didn’t know you wanted2 people · 2 mentions · first linked 2023-06-06
- How a Bug(?) in the Linux CRC-32 Checksum Turned out not to be a Bug2 people · 2 mentions · first linked 2021-03-08
What Hacker News says?
Around 4 years ago I compared lots of different median algorithms and the article turned out to be much longer than I anticipated :) https://danlark.org/2020/11/11/miniselect-practical-and-gene...
Comment linking /2020/11/11/miniselect-practical-and-generic-selection-algorithms/
on “My Favorite Algorithm: Linear Time Median Finding (2018)”Submitted Changing std:sort at Google’s scale and beyond as a story · 566 points
HN discussionI am the author of the optimization of partial sorting and selection in Clickhouse. It uses Floyd-Rivest algorithm and we tried a lot of different things back at the time, read [1] Overall clickhouse reads blocks of fixed sizes (64k) and finds top elements and then does top of the top until it converges. [1] https://danlark.org/2020/11/11/miniselect-practical-and-gene...
Comment linking /2020/11/11/miniselect-practical-and-generic-selection-algorithms/
on “ClickHouse gets lazier and faster: Introducing lazy materialization”Submitted Optimizing 128-bit Division as a story · 136 points
HN discussionYou are correct, hashes are tremendously useful for some types of data... But, hashes, while tremendously useful for some types of data, are not necessarily without problems for other data, most notably if the data has the possibility of collisions: https://en.wikipedia.org/wiki/Pigeonhole_principle https://en.wikipedia.org/wiki/Collision_(computer_science) https://danlark.org/2020/06/14/128-bit-division/ >"When it…
Comment linking /2020/06/14/128-bit-division/
on “Binary Search: A new implementation that is up to 25% faster”Submitted Optimizing 128-bit Division (2020) as a story · 61 points
HN discussionSubmitted 3 weeks writing code in Go as a story · 26 points
HN discussionSubmitted “csinc”, the AArch64 instruction you didn’t know you wanted as a story · 11 points
HN discussionSubmitted Miniselect: Practical and Generic Selection Algorithms as a story · 8 points
HN discussionSubmitted I need extra C/C++ performance now. How? as a story · 4 points
HN discussionSubmitted Changing LLVM Libc++ std:sort() at Google and beyond as a story · 3 points
HN discussion- ot · 2022-08-01
Submitted Miniselect: Practical and Generic Selection Algorithms (2020) as a story · 3 points
HN discussion Submitted Miniselect: Practical Linear Time Median Algorithms as a story · 2 points
HN discussionSubmitted How a Bug(?) in the Linux CRC-32 Checksum Turned out not to be a Bug as a story · 2 points
HN discussionSubmitted How a Bug(?) in the Linux CRC-32 Checksum Turned out not to be a Bug as a story · 2 points
HN discussionSubmitted Why is std:pair broken? as a story · 1 points
HN discussionSubmitted “csinc”, the AArch64 instruction you didn’t know you wanted as a story · 1 points
HN discussionSubmitted Miniselect: Selection Algorithms in real world (2020) as a story · 1 points
HN discussionSubmitted 128 bit division as a story · 1 points
HN discussion
