KS3 Computer Science: Selection sort
This module contains:
Compatible with the following examination boards
Download KS3 Module 11: Selection Sort
This download is exclusively for Teach Computer Science subscribers!
To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!
Already a member? Log in to 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:
