OCR GCSE Computer Science (J277)Specification point 2.1.3

OCR J277 2.1.3: Searching and sorting algorithms

The free BugBot lessons that teach this point, a robot to try it on, and the past-paper questions that test it.

Lessons that teach it

  1. F5.5 Linear search Algorithms
    Checking every item: finding a marker in the robot's sightings.
  2. F5.6 Binary search Algorithms
    Halving a sorted list, and why it needs sorted data.
  3. F5.7 Bubble sort Algorithms
    Passes and swaps, stopping early, and hearing a tune become a scale.
  4. F5.8 Insertion sort Algorithms
    Building a sorted part one item at a time, on the robot's readings.
  5. F5.9 Merge sort and comparing algorithms Algorithms
    Splitting and merging, and choosing between the searches and sorts.

Try it on a robot

The task from F5.5 Linear search, running here. Change the program and press Run.

Past paper questions on this

Real exam questions that test this, each worked through with a program you can run.

The specification is OCR's own document; this page says which of our lessons teach point 2.1.3 and is not endorsed by the board.