Namespaces
Variants
Actions

Talk:c/algorithm/bsearch

From cppreference.com

Complexity? Logarithmic, I suppose, but this is not explicitly written here.

The C standard does not specify complexity for bsearch (or qsort for that matter), and neither does POSIX, although existing implementations of course use binary search. I think it is worth a Note. --Cubbi (talk) 09:51, 5 February 2016 (PST)