Binary Search is Very Fast

I've been practicing using LLMs (mostly OpenAI o3-mini-high ) for coding. It's good at quick prototypes, and I've recently been thinking about fast set membership operations (specifically related to CSS matching ). So I've had it implement a number of different binary search algorithms. The upshot is that modern CPUs are amazingly fast. Here's the fastest version I ended up with: int sSearch ( int…