Find the average runtime complexity of binary search procedure binary search ( x : integer, a1,a2,,an : increasing integers) i:=1{i is the left endpoint of interval } j:=n{j is right endpoint of interval } while iamtheni:=m+1elsej:=m if x=ai then location :=i else location :=0 return location