Selection Sort KS3 Resources

KS3 Computer Science: Selection sort 

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
Selection Sort KS3 Resources Image 1
Selection Sort KS3 Resources Image 2
Selection Sort KS3 Resources Image 3
Selection Sort KS3 Resources Image 4
Selection Sort KS3 Resources Image 5

Download →

Selection sort

Sorting algorithms arrange the data in a particular order. Searching algorithms are used to search for data in a list. Selection sort is an algorithm used to order a list in the correct order by finding the smallest element in the list and swapping it with the item in first position. Then, the next smallest element is swapped with the element in position 2 and so on.

This KS3 Computer Science module introduces selection sort to your students, explaining:

  • Selection sort algorithm
  • How is a list sorted using a selection sort algorithm?
  • Pseudocode for selection sort algorithm
  • Analysing selection sort algorithm

More Alghoritms Modules

Selection sort is one lesson in our Algorithms module. The other theory lessons can be found below:

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