Total number of comparison for binary tree for already sorted list
Answers
Answered by
6
Note that binary search can be done only in a sorted array. ... let's now use Math. ... This leads to a total of 2*log_2(n-1) comparisons, which asymptotically indeed equals to O(log ...
Similar questions