Question: Consider the Sequential Search and the Binary Search algorithms. For any given sorted array of size a. can you say that the runtime of sequential

Consider the Sequential Search and the Binary Search algorithms. For any given sorted array of size a. can you say that the runtime of sequential search is (N)? b. can you say that the runtime of binary search is O(N)? c. can you say that the runtime of binary search is S(lg N)? Hint: Since the given array can be any array, here you should consider the general case which covers all scenarios (best and worst cases) that we discussed in class
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
