(Choose 1 answer)
☐ A
Given the Binary search algorithm (See picture)
procedure Binarysearch (a₁<a<... <a₁ x: integer)
i:=1
If input 2, 4, 5, 7, 8, 9, 10, 13 and x = 6, after the second time of dividing into sublists, the sublist to be considered is
j:=n
A. 5,7,8
B. 2, 4, 5
C. 5,7
D. 7,8,9
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
Osh
Q: 48
