Binary Search Analysis using Comparison Tree - Part 1
This video shows how to derive the worst case number of comparisons made by binary search for successful (match found) and failed (match not found) searches. It uses a comparison tree, a schematic tool that helps with the analysis. This lesson is part of a series in data structures and algorithms, by Sesh Venugopal. http://www.cs.rutgers.edu/~venugopa