Binary Search 4: Analysis (why the time is logarithmic)

In this video, I finish demonstrating that binary search runs in logarithmic time. (To be precise, it runs in worst-case and expected/average-case logarithmic time. In the best case it runs in constant time, when we find the value immediately in the middle of the list/array.)