/Ragnar Groot Koerkamp

Static Search Trees: 40x Faster Than Binary Search tl;dr: “In this post, we will implement a static search tree for high-throughput searching of sorted data. We’ll mostly take the code presented there as a starting point, and optimize it to its limits.”

featured in #580