Binary Search Description Searching algorithm that is used with a sorted array by dividing the search area in half every loop. When To Use When the data structure is sorted When accessing any element of the structure takes constant time Time Complexity O(log N)