Find a record without guessing
Explain when sorted data supports narrowing a search and when a full scan is needed.
In this lesson
- It starts with a question. Can you safely discard half an unsorted list after one comparison?
- The idea you will find. A search method depends on the data’s structure. — A linear search checks candidates in sequence and works without sorting. A binary search relies on sorted values: comparing a middle value lets you discard the side that cannot contain the target. Sorting has a cost too, so preparing an index is especially useful for repeated searches.
- How you learn it. By doing: a number line.
- Length. 8 short steps. Progress saves on this phone.
Part of Solve everyday computing problems
Handle event records, find an item, organise work and test a rule using local, interactive models.