The array is as follows: 1, 2, 3, 6, 8, 10. Given that the number 17 is to be searched. At which call it tells that there's no such element? (By using linear search(recursive) algorithm)
A. 7th call
B. 9th call
C. 17th call
D. The function calls itself infinite number of times
Answer: Option A
This Question Belongs to Data Structure >> Searching Algorithms
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