In: Computer Science
Suppose that you have a list containing the following 10 letters: A C E G L M P S T Y. Binary search is applied for the following questions.
A) What is the maximum number of comparisons needed
to find if any letter in the alphabet is in the list?
B) How many comparisons would it take to find if A is
in the list? If K is in the list?
___________________________________________________________________
___________________________________________________________________
___________________________________________________________________
Note: If you have
queries or confusion regarding this question, please leave a
comment. I would be happy to help you. If you find it to be useful,
please upvote.