News for hackers. Stuff that matters.
Re:Static search trees: 40x faster than binary search by mplanchard on Wednesday January 01, 2025 @09:43AM (#42566268)
This is someone’s blog, not an ACM publication. Why hold it to the same standard? They can write in whatever they like. I have a hard time reading Haskell, but I don’t sit and kvetch about it anytime someone wants to use it in a blog post.

There are no comments on this comment yet.