Question: True or False I could say that binary search on a sorted array is O(n^2) , O(n^3), and O(2^n), and i would be technically correct

True or False

I could say that binary search on a sorted array is O(n^2) , O(n^3), and O(2^n), and i would be technically correct

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!