Start revising free

Algorithms

GCSE Computer Science · AQA 3.1 Fundamentals of algorithms · OCR 2.1 Algorithms

Computational thinking

Searching algorithms

Exam tip: Binary search on 1000 items needs at most about 10 comparisons; linear search could need 1000.

Sorting algorithms

Key terms and facts

Algorithm
Step-by-step instructions to solve a problem
Decomposition
Breaking a problem into smaller parts
Abstraction
Removing unnecessary detail
Algorithmic thinking
Working out steps to solve a problem
Pseudocode
Simple code-like description of an algorithm
Flowchart: diamond shape means...
a decision
Flowchart: parallelogram means...
input or output
Linear search
Checks each item in order
Binary search
Halves a sorted list each time
Binary search needs...
a sorted list
Bubble sort
Swaps neighbours until in order
Merge sort
Splits the list, then merges in order
Insertion sort
Inserts each item into the right place
Fastest sort for big lists?
Merge sort
Trace table
Tracks variable values as code runs
Time efficiency
How long an algorithm takes to run

Practise algorithms

← All GCSE Computer Science topics · Open GCSE Computer Science in StudySam