ple Choices Given, Document
☑Kizspy.me
procedure Binarysearch (a<a<... <an,x: integer)
i:=1
(Choose 1 answer)
☐ A
Given the Binary search algorithm (See picture)
☐ B
ос
☐ D
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
j:=n
Back
Next
A. 10, 13
B. 13
C. 9. 10
D. 10
I want to in the exam.
while (i<j)
m:= [(i+)/2]
if xam then i: =m+1
else j:=m
if x a then location:= i
else location: 0
LAPTOP RUNNING
Q:
