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)
- Android Architecture with Jorge Ortiz-Fuentes (Online Course on 22nd - 24th February 2021)
- iOS Architecture with Jorge Ortiz-Fuentes (Online Course on 1st - 3rd March 2021)
- Haskell eXchange 2021 (Online Conference on 16th - 17th November 2021)
- Rethinking Bioinformatic Algorithms Using F# (SkillsCast recorded in October 2020)
- Accessibility in Flutter (SkillsCast recorded in August 2020)
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.