Back to Browse

Binary Search Analysis using Comparison Tree - Part 3

8.4K views
Oct 1, 2012
10:28

This last video in a 3-part lesso on analyzing binary search shows how to derive a formula for the worst number of comparisons for success and failure, as a function of the array length, n. 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

Download

1 formats

Video Formats

360pmp413.7 MB

Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.

Binary Search Analysis using Comparison Tree - Part 3 | NatokHD