Linear search

​​KS3 Computer Science: ​​Linear search

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
Linear search Image 1
Linear search Image 2
Linear search Image 3
Linear search Image 4
Linear search Image 5

Download →

​​Linear search

​An item can be searched for in a list using a linear search algorithm. The criteria in which the item has to be searched is set up. The search begins with the first item and checks whether a match is found, then it moves to the second item, and so on. This search continues until a match is found or the end of the list is reached with no match found.

This ​​KS3 Computer Science module introduces ​​​linear search to your students, explaining:

  • ​​What searching and sorting algorithms are
  • How an element is searched for in a list using a linear search algorithm
  • Pseudocode for a linear search algorithm

More Alghoritms Modules

​Linear search is one lesson in our Algorithms module. The other theory lessons can be found below: