Algorithmic Thinking in Python, for Kids

A child who has written a working loop for every earlier topic still often can't compose one for a NEW problem, because nothing in their earlier learning gave that loop shape a name to reach for. Research on this specifically distinguishes knowing syntax from having reusable schemas: novices who understand every keyword still struggle to combine them, because they re-derive each program's structure from scratch instead of recognising 'this is a max-tracking problem' or 'this is a search.' Naming the pattern is the fix this topic is built around.

Three patterns open the topic, taught back to back so their shared shape is visible: tracking the biggest or smallest value seen so far, and counting how many items pass a test — both walk a list once, carrying one value forward. Searching follows as a fourth pattern, then gets a real, counted contrast against a faster option that only works on a sorted list, so the idea that some approaches are genuinely more efficient than others lands as an observed fact rather than an assertion.

The topic closes with a real sorting algorithm, shown as a teaching vehicle rather than a practical tool — Python's own sort is always the right choice in real code — and a section on edge cases most learners never think to test: an empty list, a single item, values that are all identical. Each pattern from earlier in the topic has an assumption baked into it that one of these breaks, and finding that out here is safer than finding it out later.