The number of comparisons required to search a sorted vector of 1023 elements :

The number of comparisons required to search a sorted vector of 1023 elements using the binary search algorithm is:

  1. 20
  2. 10
  3. 15
  4. 5
Anurag Mishra Professor Asked on 13th January 2016 in Computers.
Add Comment
  • 0 Answer(s)
  • Your Answer

    By posting your answer, you agree to the privacy policy and terms of service.