Data Structure and Algorithm Analysis

Find the average runtime complexity of binary search

procedure binary search (r: integer, a.a?... ncreasing integers) i := 1 {i is the left endpoint of interval) jis right endpoint of interval) while i am then i := m + 1 else):= m if x a, then location else location := 0 return location