Suppose that we have an ordered array and we want to do the binary search on it. If we know that the best-case efficiency is 1 comparison, and the worst-case efficiency is 11 comparisons, can we say that the average-case efficiency is 6 comparisons (from (1 + 11)/2)?Group of answer choicesyesno

Suppose there are 11 items in sorted order in an array. How many searches are required on average, if binary search is employed and all searches are successful in finding the item?

Worst case efficiency of binary search is

_________ efficiency deals with a sequence of operations on the same data structure instead of single operationQuestion 1Answera.Average caseb.Amortizedc.Best cased.Worst case

The Average case occur in linear search algorithmQuestion 5Answera.When Item is the last element in the arrayb.When Item is the last element in the array or is not there at allc.When Item is not in the array at alld.When Item is somewhere in the middle of the array

For an algorithm the complexity of the average case isA Much more complicated to analyze than that of worst case.B Much more simpler to analyze than that of worst caseC Sometimes more complicated and some other times simpler than that of worst caseD None or above