Searching and sorting

About this lab: Searching and sorting

Interactive simulation for Cambridge IGCSE Computer Science 0478 topic 7 and AS & A Level 9618 topics 10.2 and 19.1: step through a linear search and a bubble sort with comparison and swap counters, then binary search, insertion sort, and graphs comparing the number of comparisons as the list grows, with Big O time complexity.

IGCSE Computer Science 0478, topic 7, and A-Level 9618, topics 10.2 and 19.1. Step forwards and backwards through linear search and bubble sort, then binary search, insertion sort and a Big O comparison for A-Level.

Searching and sorting is a free, browser-based simulation for Cambridge IGCSE Computer Science 0478 (topic 7 Algorithm design and problem-solving). The same lab serves both Cambridge IGCSE Computer Science 0478 and AS & A Level Computer Science 9618; tabs marked A-Level go beyond the IGCSE syllabus. The course is assessed in Paper 1 (Computer Systems), Paper 2 (Algorithms, Programming and Logic). Syllabus for examination in 2026-2028. There are 5 tabs, each a self-contained experiment with its own controls and live readings, and nothing to install: it runs on a laptop, tablet or classroom projector.

Syllabus coverage

• 7 (1-2) Program development life cycle, decomposition and design methods. Lessons: The program development life cycle, Decomposition, structure diagrams, flowcharts and pseudocode.
• 7 (3-4) The purpose of an algorithm and standard methods of solution. Lessons: Standard methods: linear search and bubble sort, Standard methods: totalling, counting, maximum, minimum and average.
• 7 (5-6) Validation, verification and test data. Lessons: Validation and verification checks, Normal, abnormal, extreme and boundary test data.
• 7 (7-9) Trace tables, finding errors and writing algorithms. Lessons: Dry-running algorithms with trace tables, Finding and correcting errors in algorithms, Writing and amending algorithms.
• 9618 10.2 Arrays. Lessons: 1D and 2D arrays, Linear search and bubble sort.
• 9618 19.1 Algorithms. Lessons: Binary search, Insertion sort and comparing sorts, Stacks, queues, linked lists and binary trees.

Full syllabus map: IGCSE Computer Science 0478 topic 7, A Level Computer Science 9618 topic 10 and A Level Computer Science 9618 topic 19.

How to use this simulation

1. 1. Linear search.
2. 2. Bubble sort.
3. 3. Binary search.
4. 4. Insertion sort.
5. 5. Comparing algorithms.
6. The buttons at the end of the tab strip give the scene the whole window (Full screen, Hide controls) and, on a dark stage, a projector-friendly palette (Light scene). Many scenes also have drag handles: drag them to change the set-up directly.

All simulation labs · IGCSE Computer Science 0478 · TheLucidSTEM home