A. When the element being searched for has a non uniform access storage
B. It can be applied efficiently on unsorted arrays
C. Can be used for large arrays which do not fit in the CPU cache or in the RAM
D. Can be used in magnetic tapes
Answer: Option B
This Question Belongs to Data Structure >> 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