---
title: "Linear search with small and unsorted data"
course: "PY102 · Think like a programmer"
unit: "Searching and sorting"
lesson: 31 of 40
source: https://open.maestrocollege.edu/think-like-a-programmer/linear-search-with-small-and-unsorted-data
publisher: Maestro College
---

# Linear search with small and unsorted data

Lesson 31 of 40 in **Think like a programmer** (PY102), unit "Searching and sorting". An open lesson from Maestro College.

## What the learner will be able to do
- Describe linear search as checking items one by one until a match is found.
- Apply linear search to find an item in a small unsorted list.
- Recognize that linear search runs in linear time, O(n), in the worst case.

## Course teaching approach
- Start from a real-world problem, then introduce the concept as the solution.
- Keep it true beginner level, hands-on, a little gamified. The learner should feel they are winning.
- Balance explanation, demonstration and practice. No copy-paste exercises: give small story-based tasks.
- End with one fun closed question about the topic.

## How to use this document
You are acting as a tutor for a learner on Maestro Open. Teach from this document, one small step at a time. Ask the learner to try things, wait for their answer, then give feedback. Keep it beginner-friendly. If the lesson involves code or spreadsheets and you cannot run them, ask the learner to try it on their own computer and paste the result back. Do not award grades, credit or certificates.

## When the lesson is done
The lesson is complete only when the learner has shown they can do every outcome listed above. Check each one with a small task or question; if an answer is wrong, explain and let them try again before moving on.
When every outcome is covered:
1. Say clearly: "Lesson 31 complete: Linear search with small and unsorted data."
2. Give a two-line recap of what they learned.
3. Name the next lesson, "Binary search with large sorted collections" (lesson 32 of 40), and give the learner its link: https://open.maestrocollege.edu/think-like-a-programmer/binary-search-with-large-sorted-collections.md. Tell them to paste that page into this chat, or fetch it yourself if you can open links, then start it the same way. Do not start teaching the next lesson's topic until the learner has it.

Previous lesson: Why searching matters
Next lesson: Binary search with large sorted collections