GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 24

worst case time complexity of binary search algorithm is log N but why do we’ve -1 at the end?

bro , bkz it is asking mean no. of comaprisons not time complexity

Have a doubt over this question, applying binary search is okay but does this means the index consisting of N items is sorted ?  it is not mentioned in the question anywhere and Is it a prerequisit to be known that index of N items is already sorted as we are applying binary search which works only on sorted values ??

(If its unsorted and binary search is applied we might not get the element (bcos of approach) but number of comparision remains same as mentioned logn -1 )

Pls let me know if there is any correction in my comment !!

Thank u for the clarification Sir !!

yeah bro got it now ,another silly mistake of not considering whether it’s asking about time complexity or number of comparisons