Question: Given a sorted array A of size n, we want to find if an element k belongs to this array. What will be the best

 Given a sorted array A of size n, we want to

Given a sorted array A of size n, we want to find if an element k belongs to this array. What will be the best time complexity to perform this search operation? Note: best time complexity and not the best time O(n2) O(n) O(1) O(logn)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!