Skip to content
Get the app 0

Key Stage 4 Β· Computing

Algorithms for exams

0 / 13

Test yourself Printable worksheet

Key words
algorithm
a set of step-by-step instructions to solve a problem
abstraction
removing unnecessary detail to focus on what matters
decomposition
breaking a problem into smaller parts
binary search
a search that repeatedly halves a sorted list
linear search
a search that checks each item in order
merge sort
a divide-and-conquer sort that splits and then merges lists
trace table
a table recording variable values as an algorithm runs

All key words A to Z

For grown-ups

This lesson covers the standard searching and sorting algorithms and the computational thinking terms in GCSE Computer Science. Students must be able to describe them, carry them out by hand on small lists and compare them, which is reliable exam marks with practice.

Try at home

  • Use a deck of cards: ask your teenager to sort ten cards using insertion sort, explaining each move.
  • Play a number-guessing game from 1 to 100 using binary search; it never takes more than 7 guesses.
  • Line up books by height and do one pass of bubble sort together.
  • Ask them to write the steps for making a cup of tea as an algorithm, then spot what was abstracted away.

Ask your child

  • Why can't binary search be used on an unsorted list?
  • What happens in one pass of a bubble sort?
  • When would insertion sort be a sensible choice?

Practise with a game