Which search algorithm is most efficient for a dataset that is already sorted and does not require a sorted array?
A. Binary Search
B. Linear Search
C. Hash Search
D. Interpolation Search
Answer: Option A
A. Binary Search
B. Linear Search
C. Hash Search
D. Interpolation Search
Answer: Option A
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