Binary Search: start = 0; end = length - 1;

while(start<=end){

mid = start+ (end-start)/2;

if(A[mid] == x) return mid;

else if(A[mid]>x) end = mid-1;

else start = mid+1; o(logn)