Deep Dive: 2D Arrays
Part of Insertion Sort · GCSE GCSE Computer Science revision
This study notes covers Deep Dive: 2D Arrays 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 4 of 8 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 4 of 8
Practice
15 questions
Recall
10 flashcards
Deep Dive: 2D Arrays
A 2D array is like a table or grid:
// Noughts and Crosses board array board[3, 3] board[0, 0] = "X" board[1, 1] = "O" board[2, 2] = "X" // Visualised: // [X][ ][ ] // [ ][O][ ] // [ ][ ][X]
First index = row, Second index = column
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.
Practice Questions for Insertion Sort
Which statement best describes how insertion sort works?
Describe how insertion sort works. Your answer should include how the algorithm processes each element.
Quick Recall Flashcards
15 questions on Insertion Sort — practise free
Instant marking, adaptive difficulty, and 10 spaced repetition flashcards. Free until your GCSEs.
Try PrepWise Free