Easy -1.8 This is a straightforward recall question testing knowledge of sorting algorithm steps. It requires only recognition and description of a standard algorithm (likely bubble or insertion sort) with no problem-solving, calculation, or novel application—significantly easier than typical A-level questions.
2 The instructions labelled 1 to 7 describe the steps of a sorting algorithm applied to a list of six numbers.
1 Let \(i\) equal 1.
2 Repeat lines 3 to 7, stopping when \(i\) becomes 6 .
2 The instructions labelled 1 to 7 describe the steps of a sorting algorithm applied to a list of six numbers.\\
1 Let $i$ equal 1.\\
2 Repeat lines 3 to 7, stopping when $i$ becomes 6 .\\
\hfill \mbox{\textit{OCR MEI D1 2013 Q2 [8]}}