Binary search - Wikipedia

In computer science, binary search, also known as half-interval search,[1] logarithmic search,[2] or binary chop,[3] is a search algorithm that finds the position of a target value within a sorted array.[4][5] Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remai

[A-CUP-OF-TEA]

log2(N) － 1 is about the expected number of probes in an average successful search, and the worst case is log2(N), just one more probe.

[stallman346]

お勉強

[stray346]

お勉強