The correct answer is: for a binary search, worst case is log2(N) attempts. If you're lucky it could match earlier than that.

Linear searches average half the number of elements.