What is the best case runtime of linear search(recursive) algorithm on an ordered set of elements?
A. O(1)
B. O(n)
C. O(logn)
D. O(nx)
Answer:A
What is the best case runtime of linear search(recursive) algorithm on an ordered set of elements?
A. O(1) B. O(n) C. O(logn) D. O(nx)