Binary Search
O(log n)  ·  sorted array  ·  divide & conquer
array size 11
target 42
comparisons 0
ready
active search range
mid-point comparison
target found