There are a few algorithms (for example std::merge, std::unique) that could have used a binary search but do not since the results are close to the beginning most of the time. This talk goes through building a variation on the binary search that is well suited for these cases.
YOU MAY ALSO LIKE:
- std::visit in All of It's Glory (SkillsCast recorded in July 2019)
- Fast Track to Android Architecture (in London on 21st - 23rd October 2019)
- Brian Egan's Flutter and Dart Workshop (in London on 22nd - 23rd October 2019)
- droidcon London 2019 (in London on 24th - 25th October 2019)
- iOSCon 2020 - The conference for iOS and Swift Developers (in London on 19th - 20th March 2020)
- Clean Architecture using BLoC & Voyager: DI & the Widget Router (in London on 21st October 2019)
- The Five Stages of Data: a holistic approach to data analytics and BI (in London on 21st October 2019)
- Cleaning the Big Picture: Creating Maintainable Mobile Games in Haskell (SkillsCast recorded in October 2019)
- Dawn of a New Error (SkillsCast recorded in October 2019)
Between linear and binary search
Denis worked on Yandex browser for a few years, and was an active contributor to Chromium, including pushing through and implementing Chromium's version of flat_set container. Active C++ enthusiast and passive C++ content consumer. Denis currently works for Bloomberg in London and is quite pleased with that.