This time we’re going to do something different - speed up one of the core algorithms in Julia’s standard library - searchsortedfirst, which is basically C++’s lower_bound.
Hope you like this change of pace and let me know if you’d like to do more of these types of investigations in the future.
The article was created using Pluto notebook and is available on github.