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:
- Lightbend Akka for Scala - Expert (in London on 26th - 27th November 2018)
- Scala eXchange London 2018 (in London on 13th - 14th December 2018)
- Real World Kotlin Development Workshop (in London on 28th February - 1st March 2019)
- Brian Egan's Flutter and Dart Workshop (in London on 19th - 20th March 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.