Question: 4 Finding x Design an algorithm of time-complexity O(logn) for the following task. Given a sorted array A of distinct integers of size n, and

4 Finding x Design an algorithm of time-complexity O(logn) for the following task. Given a sorted array A of distinct integers of size n, and an integer x, find out whether x is in the array. If x is in the array, print i such that of A[i]=x
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
