Searching Algorithms: Linear and Binary Search

Searching algorithms are used to find a specific item within a data set. In GCSE Computer Science, you must understand two key searching algorithms: linear search and binary search. You need to know how each one works, be able to trace through them, and compare their efficiency.

---

Linear Search

A linear search (also called a sequential search) works by checking each item in the list one at a time, starting from the first item and moving through to the last. It continues until the item is found or the end of the list is reached.

How Linear Search Works

1. Start at the first item in the list
2. Compare the current item with the item you are searching for
3. If it matches, the search is complete — return the position
4. If it does not match, move to the next item
5. Repeat steps 2-4 until the item is found or the end of the list is reached
6. If the end of the list is reached without finding the item, the item is not in the list

Pseudocode for Linear Search