Comparison continued ...
Therefore, if you have to search a list with 10^6 elements, for example,
- binary search will use about 20 comparisons
- linear search will use about 10^6 comparisons
So running time for Binary search will be proportional to 20 and the running time for Linear search will be proportional to 10^6.
Binary search is much faster than Linear search for large N.