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