Battleships - Searching Algorithms

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. This resource begins with the introductory activity of battleships. The game is then repeated to illustrate how the three different methods of searching are performed. There follows a series of extension activities and resource materials for use when playing the games. To conclude there is more information about how computers search for information. This collection of twenty activities from Computer Science Unplugged is designed to aid the teaching and learning of computer science through engaging games and puzzles using cards, string, crayons and lots of running around.