Skip to content
MathsGenie logo
Open app

Course home

x

Searching and sorting at a glance

Searching and sorting at a glance

Two-panel comparison of searching for 18: linear search checks each item in an unsorted list until index 4, and binary search halves a sorted list to find index 4

A search finds a target value in a list, while a sort rearranges the list into order. The diagram shows the key search contrast: linear search checks one by one, while binary search throws away half of a sorted range each step.

Searching and sorting algorithms Lesson

  1. GCSE
  2. /Computer Science
  3. /Searching and sorting algorithms

Step-by-step lessons covering OCR GCSE Computer Science Searching and sorting algorithms for GCSE Computer Science. Each lesson works through exam-style questions in Component 01 and Component 02 format. Build strong foundations in binary, logic and core programming constructs before moving on to the more complex algorithm design and evaluation questions.

Lessons