Skip to content
Try on iPad

Sorting algorithms: AQA A‑Level Computer Science questions

Every AQA A-Level Computer Science exam question on 4.3.5 Sorting algorithms, 2020–2025, with its mark scheme and examiner’s report.

Find questions561
Calculations

561 questions

  1. Q01.8

    June 2025 · Paper 1

    1 mark4.3.5 Sorting algorithms
    The whole paper ↗
    June 2025 Paper 1, question 01.8: After how many passes is bubble sort guaranteed to have sorted any list of 100 items? [1 mark]

  2. Q01

    June 2022 · Paper 1

    3 marks4.3.4 Searching algorithms4.3.5 Sorting algorithms
    The whole paper ↗
    June 2022 Paper 1, question 01: Big-O notation is used to express the time complexity of an algorithm. Table 1 contains a list of algorithms. State the Big-O time complexity of each of these a

  3. Q01

    November 2021 · Paper 1

    3 marks4.3.5 Sorting algorithms
    The whole paper ↗
    November 2021 Paper 1, question 01: The shaded row of Table 1 contains a list of numbers. A bubble sort algorithm could be used to sort the list of numbers into ascending order. Complete the unsha
All 3 questions on Sorting algorithms, as a list
  1. June 2025, Paper 1, Q01.8 (1 mark): After how many passes is bubble sort guaranteed to have sorted any list of 100 items? [1 mark]
  2. June 2022, Paper 1, Q01 (3 marks): Big-O notation is used to express the time complexity of an algorithm. Table 1 contains a list of algorithms. State the Big-O time complexity of each of these a
  3. November 2021, Paper 1, Q01 (3 marks): The shaded row of Table 1 contains a list of numbers. A bubble sort algorithm could be used to sort the list of numbers into ascending order. Complete the unsha

Questions, mark schemes and examiner’s reports are © AQA, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.