Question

Analyze the running time of a binary search and explain your answers:

Function max_diff(List[1], List[2], …, List[n])
min = a1
max = a1
for i = 2 to n
if List[i] < min then min = List[i]
else if List[i] > max then max = List[i]
m = |max – min|