AlgorithmsStudy Notes

Memory Trick

Part of Insertion Sort — GCSE Computer Science

This study notes covers Memory Trick within Insertion Sort for GCSE Computer Science. 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 still be part of a steady revision cycle. It is section 6 of 7 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.

Topic position

Section 6 of 7

Practice

15 questions

Recall

10 flashcards

Memory Trick

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

Keep building this topic

Read this section alongside the surrounding pages in Insertion Sort. That gives you the full topic sequence instead of a single isolated revision point.

Deep Dive: Records Exam Tips Video Lesson Organising Data

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

Want to test your knowledge?

PrepWise has 15 exam-style questions and 10 flashcards for Insertion Sort — with adaptive difficulty and instant feedback.

Join Alpha

Deep Dive: Records

Exam Tips