Select one option to show which of the following contains the false statement about the algorithm shown in the pseudocode below.
1 arr ← [15, 3, 12, 6, 19]
2 FOR i ← 1 TO 4
3 key ← arr[i]
4 j ← i - 1
5 WHILE j >= 0 AND arr[j] > key
6 arr[j + 1] ← arr[j]
7 j ← j - 1
8 ENDWHILE
9 arr[j + 1] ← key
10 ENDFOR
The algorithm performs an in-place sort, meaning it does not copy the elements into a new, separate array.
After the outer loop completes its first iteration (when i=1i = 1i=1), the state of the array arr is [3, 15, 12, 6, 19].
The outer loop represents indefinite iteration because the total number of passes depends on the initial order of the elements in the array.
The inner loop uses indefinite iteration and terminates either when an element less than or equal to key is encountered, or when j<0j < 0j<0.
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.