retagged by
1,727 views
1 1 vote
Binary search can be carried out on a set of ordered data items stored in a

(A) Array (B) Stack (C) Queue (D) List

1 Answer

Answer:
Position:
Show:

Related questions

0 0 votes
1 1 answer
132
132 views
GO Classes asked Aug 26
132 views
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
173
173 views
GO Classes asked Aug 12
173 views
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
194
194 views
GO Classes asked Aug 4
194 views
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...
4 4 votes
2 2 answers
827
827 views
gatecse asked Feb 23
827 views
Let A be a sorted array containing $1000$ distinct integers. You perform a recursive binary search on $\text{A}$ to find an element $\text{y}$. Suppose each comparison ch...