Memory Trick

Part of Merge Sort · Section 6 of 8

Study NotesUnit: 3.1 Fundamentals of AlgorithmsGCSE

This study notes covers Memory Trick within Merge Sort for GCSE Computer Science. Revise Merge Sort in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 16 exam-style questions and 10 flashcards. This topic appears less often, but it can still be a useful differentiator on mixed-topic papers. 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

random(1, 6) = 1 to 6 inclusive = dice roll
Think: What numbers could a dice show?

Practice questions for Merge Sort

Which design strategy does merge sort use?

A. Brute force — try every possible ordering
B. Greedy — always pick the locally best element
C. Divide and conquer — split the list, sort halves, then merge
D. Dynamic programming — store results to avoid repeated work

1 markfoundation

Describe how merge sort works. You should include what happens in both the divide and merge phases.

3 marksstandard

Quick recall flashcards

Is merge sort a recursive algorithm?

Yes - it calls itself on smaller sub-lists

What technique does merge sort use?

Divide and conquer - splits list in half repeatedly then merges sorted halves

Deep Dive: Uses of Random Numbers

Exam Tips

16 questions on Merge Sort — practise free

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

Start revising free →