Given an array arr = {45, 77, 89, 90, 94, 99, 100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
A. 90 and 99
B. 90 and 100
C. 89 and 94
D. 94 and 99
Answer: Option A
A. 90 and 99
B. 90 and 100
C. 89 and 94
D. 94 and 99
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