Question: 112
(Choose 1 answer)
Given the Bubble sort algorithm (See picture)
Procedure Bubblesort(a1,a2,...,an: integer)
for i = 1 to (n-1) do for j = 1 to (n-i) do if a; > a+1 then swap(aj, aj+1)
If input = 3, 2, 4, 7, 1, 6, 5, find the order of the elements after completing the first pass (i = 1).
A. 2, 3, 4, 1, 6, 5, 7
B. 2, 3, 4, 1, 5, 6, 7
C. 2, 3, 1, 4, 6, 5, 7
D. 2, 3, 1, 4, 5, 6, 7
E. None of the other choices is correct
