Skip to content

Course home

Sorting algorithms

Sorting algorithms

EasyMediumHard
12345678910111213141516171819202122
Question 15

An algorithm is represented in the pseudo-code below:

1  readings[0] ← 34.2
2  readings[1] ← 12.8
3  readings[2] ← 21.5
4  FOR i ← 0 TO 1
5      FOR j ← 0 TO 1
6          IF readings[j] > readings[j + 1] THEN
7              temp ← readings[j]
8              readings[j] ← readings[j + 1]
9              readings[j + 1] ← temp
10         ENDIF
11     ENDFOR
12 ENDFOR

State the purpose of this algorithm.

[1]
Markscheme

Sorting algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Sorting algorithms

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.

Question bank