When used with a SortedRange, std.algorithm.find() should search an item using a binary search in O(log(n)). Now it performs a O(n) scan. Maybe it could use lowerbound() function inside std.range.
PR: https://github.com/D-Programming-Language/phobos/pull/3534
this has been addressed in: https://github.com/dlang/phobos/pull/4907
FYI: I opened an issue for addressing more functions: https://issues.dlang.org/show_bug.cgi?id=17030