Searching Algorithms

  Classroom Resource Information  


Searching Algorithms


Content Source:

CS Unplugged
Type: Learning Activity


Searching for a keyword or value is the basis of many computing applications, whether on an internet search engine or looking up a bank account balance.

This activity explores the main algorithms that are used as the basis for searching on computers, using different variations on the game of battleships.

Computers are often required to find information in large collections of data. They need to develop quick and efficient ways of doing this. This activity demonstrates three different search methods: linear searching, binary searching, and hashing.
Content Standard(s):
Digital Literacy and Computer Science
DLIT (2018)
Grade: 5
19) Conduct advanced keyword searches to produce valid, appropriate results and evaluate results for accuracy, relevance, and appropriateness.

Examples: Search techniques, check for credibility and validity.

Digital Literacy and Computer Science
DLIT (2018)
Grade: 6
5) Identify algorithms that make use of sequencing, selection or iteration.

Examples: Sequencing is doing steps in order (put on socks, put on shoes, tie laces); selection uses a Boolean condition to determine which of two parts of an algorithm are used (hair is dirty? True, wash hair; false, do not); iteration is the repetition of part of an algorithm until a condition is met (if you're happy and you know it clap your hands, when you're no longer happy you stop clapping).

Digital Literacy and Computer Science
DLIT (2018)
Grade: 7
3) Create algorithms that demonstrate sequencing, selection or iteration.

Examples: Debit card transactions are approved until the account balance is insufficient to fund the transaction = iteration, do until.

Tags: algorithm, binary searching, hashing, linear searching, search
License Type: Attribution Non-Commercial Share Alike
For full descriptions of license types and a guide to usage, visit :
  This resource provided by:  
Author: Aimee Bates