Binary Search

Module: CS2040S Lecture: Lecture 03 Binary search is HARD! What is Binary Search? Bineary search is an algorithm that allows you to find the item you want in a sorted list in $O(\log(n))$ time. It accomplishes this by dividing the list into two parts, check which part the target value is in, and then go on to divide that part of the list into two parts …… An Example by Hand Here is an example where we do binary search by hand....