AlgorithmsStudy Notes

Arrays

Part of Insertion Sort — GCSE Computer Science

This study notes covers Arrays 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 3 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 3 of 7

Practice

15 questions

Recall

10 flashcards

Arrays

Operation	OCR Pseudocode	Example
Declare 1D array	array name[size]	array scores[10]
Access element	name[index]	scores[0] = 85
Declare 2D array	array name[rows, cols]	array grid[3, 4]
Access 2D	name[row, col]	grid[1, 2] = "X"

Note: Arrays are 0-indexed (first element is index 0)

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

Arrays

Arrays

Keep building this topic

Practice Questions for Insertion Sort

Quick Recall Flashcards

Want to test your knowledge?