Question: 15
(Choose 1 answer)
Given the Binary search algorithm (See picture)
If input = 2, 4, 5, 7, 8, 9, 10, 13 and x = 11, after the second time of dividing into sublists, the sublist to be
considered is
procedure Binarysearch(a₁<a<... <ax: integer)
i:=1
j:=n
while (i<j)
m:=[(i+)/2]
if xam then i:=m+1
else j:=m
if x a; then location:= i
else location:= 0
A. 10, 13
B. 9, 10, 13
C. 9, 10
D. 10
