easy5 pts · first answer countssorting-and-searching

Best case of binary search

What is the best-case time of binary search on a sorted array of n items, and when does it happen?

A.O(log n), since every search halves the rangeB.O(1), when the first middle item is the targetC.O(n), when the target is the last itemD.O(n log n), when the array has duplicates

Discussion 0

Join free to post in the discussion.

Best case of binary search

Discussion 0

Related questions