Top all-time · #12518
mhdm.dev
Personal blog · mhdm.dev/postsprogramminghardware
mhdm.dev is a personal blog at mhdm.dev about programming and hardware. Since 2023, 6 different Hacker News readers have linked it 9 times, most often “Fastest Branchless Binary Search”. The last post was in 2023, but the archive is still widely read.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN readers link mhdm.dev's post on the fastest branchless binary search, pointing to its prefetching section for large arrays. Commenters use it to address the large-array case.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Software and hardware engineering articles on 3d printers, arduino, microcontrollers, machining and math.
Most-linked posts?
- Fastest Branchless Binary Search6 people · 7 mentions · first linked 2023-06-29
What Hacker News says?
Then you'll want to look at https://mhdm.dev/posts/sb_lower_bound/#prefetching 100mb is large enough that the branchy version turns out to have a slight advantage, more due to quirks of x86 (speculative execution) rather than being better.
Comment linking /posts/sb_lower_bound/
on “Fastest Branchless Binary Search”Submitted Fastest Branchless Binary Search as a story · 37 points
HN discussionPrefetching is the right tradeoff for large arrays. Addressed at the end of the article: https://mhdm.dev/posts/sb_lower_bound/#prefetching
Comment linking /posts/sb_lower_bound/
on “Fastest Branchless Binary Search”Submitted Fastest Branchless Binary Search as a story · 12 points
HN discussionSubmitted Fastest Branchless Binary Search as a story · 4 points
HN discussionSubmitted Fastest Branchless Binary Search as a story · 1 points
HN discussionSubmitted Fastest Branchless Binary Search as a story · 1 points
HN discussionSubmitted Fastest Branchless Binary Search as a story · 1 points
HN discussionSubmitted Branchless Binary Search – 2x faster than C++ std:lower_bound() as a story · 1 points
HN discussion