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
Get step-by-step solutions from verified subject matter experts
