Skip to content
PlayOwl

Coding · Grade 7

Algorithms for Search and Organization

Learners trace linear search and binary search, counting comparisons with an interactive search tracer, and see why binary search needs sorted data. They sort lists with bubble sort pass by pass and compare algorithms by how their work grows, deciding when sorting first pays off.

  • 4 lessons
  • About 80 minutes
  • Check what you learned: 8 questions
  • Ways to answer: choose an answer, trace code, type a number, put in order and sort into groups
Try it now (no account) One of the five free starter courses Open in PlayOwl

What learners will discover

  • Trace linear search and count the comparisons it makes.
  • Trace binary search on a sorted list and explain why it requires sorted data.
  • Trace bubble sort pass by pass and predict the list after each pass.
  • Compare algorithms by how their number of steps grows and choose one for a situation.

Lessons

  1. Linear search 6 steps2 practiceabout 18 min
  2. Binary search 6 steps3 practiceabout 22 min
  3. Sorting with bubble sort 5 steps3 practiceabout 22 min
  4. Comparing algorithms 5 steps3 practiceabout 18 min
  5. Check what you learned 8 questions at the end

Keep exploring

Games to practice with

  • Bug DetectiveA robot program almost works. Run it, spot the buggy block, and fix it.
  • Sorting FactoryTurn a work order into if/else rules and watch the conveyor sort every item.
  • Garden AutomationProgram a garden robot with sensor rules — then watch a whole day play out.

More 7th grade coding

Guide for grown-ups