Skip to content
Android waitlistTry on iPad

Evaluating algorithms: Edexcel GCSE Computer Science questions

Every Edexcel GCSE Computer Science exam question on 1.2.7 Evaluating algorithms, 2022–2025, with its mark scheme and examiner’s report.

Find questions210
Paper
All papers
Exam
All years
Calculations

210 questions

  1. Q5(d)(i)

    June 2025 · Paper 1

    2 marks1.2.7 Evaluating algorithms1.2.6 Sorting and searching algorithms
    The whole paper ↗

  2. Q5(d)(ii)

    June 2025 · Paper 1

    2 marks1.2.7 Evaluating algorithms1.2.6 Sorting and searching algorithms
    The whole paper ↗

  3. Q1(f)(ii)

    June 2024 · Paper 1

    2 marks1.2.7 Evaluating algorithms1.2.6 Sorting and searching algorithms
    The whole paper ↗

  4. Q5(b)

    June 2022 · Paper 1

    2 marks1.2.7 Evaluating algorithms1.2.6 Sorting and searching algorithms
    The whole paper ↗
All 4 questions on Evaluating algorithms, as a list
  1. June 2025, Paper 1, Q5(d)(i) (2 marks): Explain the worst case for a linear search on an array. (2)
  2. June 2025, Paper 1, Q5(d)(ii) (2 marks): Explain the best case for a bubble sort on an array. (2)
  3. June 2024, Paper 1, Q1(f)(ii) (2 marks): Explain one effect the number of comparisons has on the execution time of a sorting algorithm. (2)
  4. June 2022, Paper 1, Q5(b) (2 marks): This algorithm searches a sorted array of numbers for a target value. The target value may or may not be in the array. The use of the found variable helps to ma

Questions, mark schemes and examiner’s reports are © Pearson Edexcel, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Every Edexcel GCSE Computer Science paper.

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