Comparing sorting algorithms

​​KS3 Computer Science: ​​Comparing sorting algorithms

This module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall
  • A quiz with answer key to test knowledge and understanding of the module
Compatible with the following examination boards
Comparing sorting algorithms Image 1
Comparing sorting algorithms Image 2
Comparing sorting algorithms Image 3
Comparing sorting algorithms Image 4
Comparing sorting algorithms Image 5

Download →

​Comparing sorting algorithms

​Efficiency of algorithms can be compared using time and space requirements. Time requirements denote the time taken to complete the task.
Space requirements denote the amount of memory required to complete the task.

This ​​KS3 Computer Science module introduces ​​​sorting algorithms to your students, explaining:

  • ​​Determining the efficiency of an algorithm
  • Time and space measures
  • Comparing sorting algorithms
  • Empirical testing

More Alghoritms Modules

​Comparing sorting algorithms is one lesson in our Algorithms module. The other theory lessons can be found below:

Comparing sorting algorithms Image 6
​​Introduction to algorithms
Comparing sorting algorithms Image 7
​Bubble sort
Comparing sorting algorithms Image 8
​Selection sort 
Comparing sorting algorithms Image 9
​Linear search 
Comparing sorting algorithms Image 10
​Binary search 
Comparing sorting algorithms Image 11
​​Comparing search algorithms