Algorithms: Binary Search Features Start with a sorted array or list. Searching starts at the middle. Splits the array in 2. Read is O(log(n)) in the best case, and O(n) on the worst case.