Binary Search Algorithm
Binary search will take 18 steps—a big difference! In general, for any
list of n, binary search will take log2 n steps to run in the worst case,
whereas simple search will take n steps.

Binary search will take 18 steps—a big difference! In general, for any
list of n, binary search will take log2 n steps to run in the worst case,
whereas simple search will take n steps.