In this video, I introduce the binary search algorithm at a very high level, as it applies to looking for a number in a sorted list/array, or looking for a name in a telephone book (in alphabetical order). I argue that binary search is substantially faster than sequential search, but I don't begin my proper run-time analysis until the next video.
