Question

Please show explanation on how you got answer

(Question 1 )How many best and worst case for a binary search on sorted array of 4 elements

A: Worst - 2 , Best - 1

B: Worst - 2 , Best - 0

C: Worst - 6 , Best - 0

D: Worst - 6 , Best - 1

E: Worst - 3 , Best - 1

(Question 2 )How many best and worst case for a binary search on sorted array of 7 elements

Answer 1

******************************************************************************************
Please Upvote the answer as it matters to me a lot :)
*****************************************************************************************
As per HomeworkLib expert answering guidelines,Experts are supposed to answer only certain number of questions/sub-parts in a post.Please raise the remaining as a new question as per HomeworkLib guidelines.
******************************************************************************************

if the size of the array is x then In the best case a binary search on sorted elements takes

only 1 comparison

if the size of the array is x then In the worst case a binary search on sorted elements takes

only ceil(log n) comparison

so when x=3 = ceil(log3) = 2

when x= 7 = ceil(log7) = 3