3 ms·
> What exactly do you mean with "writing faster search and sort algorithms"? - Branchless binary search: https://news.ycombinator.com/item?id=35737862 https:/
by ignoramous 3y ago
> What exactly do you mean with "writing faster search and sort algorithms"?
- Branchless binary search: https://news.ycombinator.com/item?id=35737862 https://news.ycombinator.com/item?id=35737862 / https://news.ycombinator.com/item?id=14598098 https://news.ycombinator.com/item?id=14598098
- Static B-Trees for faster binary search: https://news.ycombinator.com/item?id=30376140 https://news.ycombinator.com/item?id=30376140
Presumably there's even more literature on the topic.
- anyfoo 3y agoThose are neat optimizations of the constant, but even with that, a linear scan can still be much faster under the right (and not unrealistic) circumstances. But I see now you were referring to the branch predictor part specifically, so all good.