SkillsCast
Between linear and binary search
SkillsCast
About the Speaker
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:
Thanks to our sponsors
Between linear and binary search
Denis Yaroshevskiy
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.