Kizspy | Question: 14
(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 third time of dividing into sublists, the sublist to be considered is_
A. 13
B. 10
C. 10, 13
D. 9, 10
procedure Binarysearch(a₁<a₂<... <an, x: integer)
i:=1
j:=n
while (i<j)
m:=[(i+j)/2]
if x> am then i: = m+1
else j:=m
if x = a; then location: = i
else location: = 0
