Question discussion

What is the maximum number of comparisons needed by binary search in a sorted array of 1024 elements?

1134Medium DSSSB TGT Computer Science 0 replies 1 views

Correct answer: D

Explanation

The worst case is ⌊log₂ n⌋ + 1 = 10 + 1 = 11 comparisons.

Nobody has replied yet. Start the discussion!