Suppose we have a sorted array of n numbers, A[1] ≤ A[2] ≤ ... ≤ A[n]. Write an algorithm that searches the array to see
Posted: Fri Jul 08, 2022 6:43 am
Suppose we have a sorted array of n numbers, A[1] ≤ A[2] ≤ ... ≤A[n].
Write an algorithm that searches the array to see if thisarray contains a particular number x.
If the number is present then report index of the number,otherwise report nil.
The algorithm time complexity should not be higher than O(logn)
Write an algorithm that searches the array to see if thisarray contains a particular number x.
If the number is present then report index of the number,otherwise report nil.
The algorithm time complexity should not be higher than O(logn)