Is there any benefit to using this over stdlib.h bsearch()?

A more flexible approach is to use a comparison function pointer argument, which allows adapting it to comparing all kinds of data, not only strings.

@gebart : It could be implemented in terms of bsearch, but in the end you'll end up with even more code. The idea of adding a comparison callback is quite easy to implement, but I don't know how useful it will be.
My idea when doing this was to make array searching take one line for the most common case.

In my opinion, a custom comparison I'd extremely useful. Even just reversing the sort order can be trivially implemented with a custom comparison function (cmp(a, b) { return a > b;} vs. cmp(a, b) { return a < b;})

I don't like adding code which does the same thing as some standard library part unless there is any special circumstance that makes the standard library version unsuitable (e.g. the fmt library which uses a lot less memory than the libc printf family of functions).
The standard library components are usually pretty well tested, and we don't have to maintain the implementations.