Sorting algorithms

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

Question 4

Select the option that contains the false statement about the algorithm in Figure 1.

Figure 1

1  CONSTANT MAX_INDEX ← 3
2  arr ← [9, 4, 7, 2]
3  swapped ← true
4  WHILE swapped = true
5      swapped ← false
6      FOR i ← 0 TO MAX_INDEX - 1
7          IF arr[i] > arr[i+1] THEN
8              temp ← arr[i]
9              arr[i] ← arr[i+1]
10             arr[i+1] ← temp
11             swapped ← true
12         ENDIF
13     ENDFOR
14 ENDWHILE

The algorithm uses nested iteration.

The algorithm uses only definite iteration.

The algorithm uses a named constant.

The algorithm uses a temporary variable to swap elements.

Sorting algorithms

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

Question 4

Select the option that contains the false statement about the algorithm in Figure 1.

Figure 1

1  CONSTANT MAX_INDEX ← 3
2  arr ← [9, 4, 7, 2]
3  swapped ← true
4  WHILE swapped = true
5      swapped ← false
6      FOR i ← 0 TO MAX_INDEX - 1
7          IF arr[i] > arr[i+1] THEN
8              temp ← arr[i]
9              arr[i] ← arr[i+1]
10             arr[i+1] ← temp
11             swapped ← true
12         ENDIF
13     ENDFOR
14 ENDWHILE

The algorithm uses nested iteration.

The algorithm uses only definite iteration.

The algorithm uses a named constant.

The algorithm uses a temporary variable to swap elements.

Sorting algorithms

Question 4

Figure 1

Markscheme

Sorting algorithms

Question 4

Figure 1

Markscheme

Sorting algorithms

Question 4

Figure 1

Sorting algorithms Questions

Sorting algorithms

Question 4

Figure 1

Sorting algorithms Questions