What is the worst-case time complexity of linear search and binary search, respectively? A. O (n log2
Question:
What is the worst-case time complexity of linear search and binary search, respectively?
A. O (n log2 n), O(log2 n)
B. O(log2 n), O(n)
C. O(n), O(log2 n)
D. O(1), O(n)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Data Structures Using C A Practical Approach For Beginners
ISBN: 9781000470741
1st Edition
Authors: Amol M Jagtap, Ajit S Mali
Question Posted: