number of comparisons of binary search
Posted
by user307496
on Stack Overflow
See other posts from Stack Overflow
or by user307496
Published on 2010-04-07T06:40:39Z
Indexed on
2010/04/07
6:43 UTC
Read the original article
Hit count: 289
What is the total number of comparisons necessary to locate all the n sorted distinct integers in an array using binary search, I think it is nlogn, but I am not sure. What do u guys think?
© Stack Overflow or respective owner