Register

Binary Search
closed

• closed by
1,571 views
3 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.

Voting & Accepting an answer helps improve the community
← Previous · Operator Precedence ...Next → · Linked List
← Previous in category · Time complexityNext in category → · back-substitution
Position:
Show:

Related questions

1 1 vote
1 1 answer
209
209 views
GO Classes asked Aug 26
209 views
GO Classes DPP | GATE CS, DA | Algorithms | Binary Search
Which of the following cannot be a sequence of keys compared during a binary search for some target key?$500,200,450,180$ $500,450,200,180$ $180,500,200,450$ $180,200,500...
2 2 votes
2 2 answers
220
220 views
GO Classes asked Aug 12
220 views
GO Classes DPP | GATE CS, DA | Algorithms | Binary Search Insertion
Suppose Binary Search is used in Insertion Sort to locate where the $i$th element should be inserted among the first $i-1$ elements.What is the worst-case running time of...
2 2 votes
1 1 answer
233
233 views
GO Classes asked Aug 4
233 views
GO Classes DPP | GATE CS, DA | Algorithms | Binary Search
A sorted table contains $2000$ distinct elements in increasing order. A key is searched using binary search, and it is guaranteed that the key exists in the table.What is...
0 0 votes
2 2 answers
1.9k
1.9k views
dhruba asked Jun 5, 2023
1,902 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). How many comparisons are needed in the worst case scenario to determine that the key is not in the array?
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). Ho...