Complete the trace table for the algorithm shown in Figure 1.
Some values have already been entered. You may not need to use all the rows in the table.
1 arr[0] ← 8
2 arr[1] ← 5
3 arr[2] ← 3
4 FOR i ← 0 TO 1
5 FOR j ← 0 TO 1
6 IF arr[j + 1] < arr[j] THEN
7 temp ← arr[j]
8 arr[j] ← arr[j + 1]
9 arr[j + 1] ← temp
10 ENDIF
11 ENDFOR
12 ENDFOR
| arr | i | j | temp | ||
|---|---|---|---|---|---|
| [0] | [1] | [2] | |||
| 8 | 5 | 3 | |||
52 exam-style questions on AQA GCSE Computer Science Sorting algorithms. Each one has a worked solution and a mark scheme showing where the marks go.