PrepWisePrepWiseComputer Science
AlgorithmsMedium Exam FrequencyOCR

Insertion Sort

Revise Insertion Sort in Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This topic appears regularly enough that it should be part of a solid GCSE revision cycle.

Study this topic

1

Video Lesson

Notes2

Organising Data

Introduction3

Arrays

Notes4

Deep Dive: 2D Arrays

Notes5

Deep Dive: Records

Notes6

Memory Trick

Notes7

Exam Tips

Notes

Sample Flashcards

How does insertion sort work?
Builds sorted list one element at a time by inserting each element into its correct position
What is the time complexity of insertion sort?
O(n²) worst/average case, O(n) best case (already sorted)

Sample Questions

Which statement best describes how insertion sort works?

  • A. It repeatedly swaps adjacent elements until the list is sorted
  • B. It divides the list in half repeatedly and merges sorted halves
  • C. It takes each element and inserts it into its correct position in the already sorted portion
  • D. It selects the smallest element and swaps it to the front each pass
1 markfoundation

Describe how insertion sort works. Your answer should include how the algorithm processes each element.

3 marksstandard

15

exam-style questions

10

revision flashcards

Ready to revise Insertion Sort?

Get personalised daily study plans, adaptive quizzes, and spaced repetition flashcards.

Join Alpha

Previous topic

Merge Sort

Next topic

Variables & Constants