Memory Trick

Part of Insertion Sort · Section 6 of 8

Study NotesUnit: 3.1 Fundamentals of AlgorithmsGCSE

This study notes covers Memory Trick within Insertion Sort for GCSE Computer Science. Revise Insertion Sort in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This topic appears regularly enough that it should still be part of a steady revision cycle. It is section 6 of 8 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.

Memory Trick

Array = All the same type, Access by number
Record = Related fields, Access by name (using dot .)

Practice questions for Insertion Sort

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

Quick recall flashcards

What is the time complexity of insertion sort?

O(n²) worst/average case, O(n) best case (already sorted)

How does insertion sort work?

Builds sorted list one element at a time by inserting each element into its correct position

Deep Dive: Records

Exam Tips

15 questions on Insertion Sort — practise free

Instant marking, adaptive difficulty and spaced-repetition flashcards — all aligned to your exam board.

Start revising free →