function p = binary_search(A,t)
array_length = length(A);
counter = 0;
L_SearchRange = 1;
R_SearchRange = array_length;
while counter <= floor(log2(array_length))+1
mid = (L_SearchRange + R_SearchRange)/2;
if t == A(floor(mid))
p = floor(mid);
break
else if t > A(floor(mid))
L_SearchRange = floor(mid)+1;
else
R_SearchRange = floor(mid)-1;
if R_SearchRange == 0
counter = counter +1;
end
end
counter = counter+1;
end
end
if counter > floor(log2(array_length))+1
disp('target is not found in aray')
end
end