Multiple choices 10/50
Answer (Choose 1 answer)
Given the Insertion sort algorithm (See picture)
If input = 3, 2, 4, 7, 1, 6, 5, after running the outer loop with i = 5, the order of the elements in the list is
A. 1, 2, 3, 4, 6, 7, 5
B. 1, 2, 3, 4, 7, 5, 6
Next
C. 1, 2, 3, 7, 4, 6, 5
D. 1, 2, 3, 4, 7, 6, 5
Procedure Insertionsort(a1,a2,...,an: integer)
for i = 2 to n do
j:= 1
while a < ai
j:= j+1
temp: = a
for k: i down to j+1
ax:= ak-1
a := temp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36 37
38
39
40
41
42
43
44
45
46 47
48 49 50
