closed by
1,037 views
3 votes
3 votes
closed with the note: Sorted.Misconception Regarding Calculation Of mid element.

In this given question I find all answers false because while implementing binary seach or tracing it for an example we need to follow same approach Right? if we are taking ceil for evaluation then it should be considered throughout and if we are taking floor accordingly it should be traced.Therefore applying both operating individually I find none of the options matching.
Correct Me If I am wrong here.

closed by

Related questions

0 votes
0 votes
2 answers
1
dhruba asked Jun 5, 2023
1,089 views
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). ...
0 votes
0 votes
1 answer
2
Sabir Khan asked Aug 8, 2018
1,056 views
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is(A) (n)(B) (logn)(C) (log*n)(D) (1)
3 votes
3 votes
1 answer
3
iarnav asked Mar 13, 2018
1,938 views
The average successful search time taken by binary search on a sorted array of 5 CONSECUTIVE integers starting with 1?My Answer is - 2.2Kindly tell me is it correct or no...
3 votes
3 votes
2 answers
4
rahul sharma 5 asked Mar 8, 2018
2,359 views
Why to prefer binary search over ternary search?Can someone give recreance relation for ternary search,so that i can compare both