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.
On this page of the site you can watch the video online Binary Search 2: The Basic Idea with a duration of hours minute second in good quality, which was uploaded by the user davefeinberg 01 July 2011, share the link with friends and acquaintances, this video has already been watched 9,002 times on youtube and it was liked by 59 viewers. Enjoy your viewing!