State two factors that may affect the performance of a sorting algorithm.

Mark scheme

Marking points from the official mark scheme (May/June 2021). The mark or mark type is shown in brackets.

1. [2] One mark for each correct marking point (Max 2)
2. [2] The initial order of the data
3. [2] The number of data items to be sorted
4. [2] The efficiency of the sorting algorithm
5. [6] One mark for each marking point (max 6)
6. [6] MP1 Use of FOR loop to cycle through the whole year group
7. [6] MP2 Temporary storage of the score being 'inserted'
8. [6] MP3 Temporary storage of the corresponding name elements
9. [6] MP4 Use of WHILE loop with correct exit clause
10. [6] MP5 Moving of all three elements of data to next array elements
11. [6] MP6 Correct updating of counter variable
12. [6] MP7 Final insertion of all three data elements
13. [6] Example algorithm YearSize ← 249 FOR Student ← 2 to YearSize Temp1 ← Score [Student] Temp2 ← Name [Student,1] Temp3 ← Name [Student,2] Counter ← Student WHILE Counter > 1 AND Score [Counter - 1] < Temp1 Score [Counter] ← Score [Counter - 1] Name [Counter,1] ← Name [Counter - 1,1] Name [Counter,2] ← Name [Counter - 1,2] Counter ← Counter - 1 ENDWHILE Score [Counter] ← Temp1 Name [Counter,1] ← Temp2 Name [Counter,2] ← Temp3 NEXT Student