Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore advanced optimization techniques for binary search algorithms in this CppCon 2022 conference talk by Sergey Slotin. Delve into branchless programming, memory layout optimization, and SIMD instructions to achieve up to 15x performance improvements over std::lower_bound. Learn how to apply these techniques to fundamental algorithms, making them significantly faster and more efficient. Discover the potential for multifold improvements in textbook algorithms and gain insights into performance engineering that can be applied to various software projects. Follow along as Slotin demonstrates the development of an optimized binary search algorithm, covering topics such as pipeline hazards, cache efficiency, memory optimization, and adaptive tree growth.