Skip to content
PlayOwl

Coding · Grade 5

Decomposition and Algorithm Design

Fifth graders decompose problems into sub-problems and design pseudocode algorithms for them, compare linear and binary search by counting comparisons (and learn why binary search needs sorted data), carry out the swap (bubble) sort counting passes and swaps, and choose algorithms by weighing trade-offs.

  • 4 lessons
  • About 95 minutes
  • Algorithm design check: 8 questions
  • Ways to answer: choose an answer, put code in order, 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

  • Decompose a problem into sub-problems and design an algorithm for one of them in pseudocode.
  • Compare linear and binary search by counting comparisons, and explain why binary search needs a sorted list.
  • Carry out the swap (bubble) sort and count its passes and swaps.
  • Choose an algorithm by weighing trade-offs such as sorted data, list length and how often it runs.

Lessons

  1. Decompose, then design 4 steps2 practiceabout 18 min
  2. Linear search and binary search 6 steps3 practiceabout 18 min
  3. Sorting with swaps 5 steps3 practiceabout 17 min
  4. Choosing an algorithm 5 steps2 practiceabout 15 min
  5. Algorithm design check 8 questions at the end

Keep exploring

Games to practice with

  • Robot RoutesSnap together arrow, repeat and dance blocks to guide Bolt the robot home.
  • 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.

More 5th grade coding

Guide for grown-ups