News for hackers. Stuff that matters.
Re:Static search trees: 40x faster than binary search by curiouscoding on Wednesday January 01, 2025 @11:46AM (#42567158)
Assuming this is going to save someone 10ns per query in the end and I spent 150h on coding and writing this up, we only(?) need around 10^14 queries to make it worth it!

But yes, as new technologies stack up, we achieve exponential growth in throughput in the end, which usually enables new science :)

There are no comments on this comment yet.