Choose the correct while loop statement from the following that finds the range where are the element being search is present (x is the element being searched in an array arr of size n)?
A.
while (i < n && arr[i] <= x)
i = i*2; B.
while (i < n && arr[i] <= x)
i = i/2; C.
while (arr[i] <= x)
i = i/2; D.
while (i < n)
i = i*2; Answer: Option A
Related Questions on Searching Algorithms
A. Jump Search
B. Linear Search
C. Interpolation Search
D. Binary Search
What is the time complexity of binary search on a sorted array?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(log n)
What is the time complexity of binary search in a balanced binary search tree (BST)?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(1)
Which searching algorithm is most efficient for large datasets that are sorted?
A. Jump Search
B. Interpolation Search
C. Linear Search
D. Binary Search

Join The Discussion