Beyond Binary Search: When Interpolation Beats Quaternary, Radix, and SIMD
You have a sorted array. Need to search it. `std::lower_bound`: O(log n), predictable, robust. This is the default solution. But my industry experience breeds skepticism. Every few months, a new paper
Modern C++ // dev Apr 28, 2026 10 min read
Lock-Free Queue Implementations Compared: Correctness, Performance, and the Bugs You'll Ship
A `std::mutex`-protected `std::deque` is 12% faster than moodycamel::ConcurrentQueue when contention is low.
Modern C++ // dev Mar 6, 2026 12 min read