Dividing Problems, Conquering Complexity
Algorithmic thinking through divide-and-conquer strategies
This workshop introduces students to algorithmic problem solving by showing how complex tasks can be simplified through systematic splitting, coordination, and recombination.
Workshop Overview
Students explore algorithms through intuitive, hands-on activities. The central idea is divide-and-conquer: breaking a large problem into smaller parts, solving those parts, and combining the results to solve the original task efficiently.
Conceptual Framework
Divide-and-conquer is presented as a general strategy used in computer science and everyday reasoning. Students compare this approach with other styles, such as greedy decision-making, to understand when splitting a problem leads to better clarity, speed, or accuracy.
Activities
- Everyday examples of divide-and-conquer (putting on shoes, carrying loads, navigation, nesting)
- Tromino Sorting Game (2- or 4-player collaborative challenge)
- Number Card Sorting Relay (team-based algorithmic game)
Learning Outcomes
By the end of the workshop, students will be able to:
- Explain what an algorithm is using concrete examples
- Describe divide-and-conquer as a strategy for reducing complexity
- Recognize situations where splitting a task improves efficiency
- Compare divide-and-conquer with simple greedy approaches
- Collaborate to solve structured, rule-based challenges
Setting
Classroom
Participants
Grades 6–8 students
Format
Conceptual exploration, group games, collaborative sorting, and challenges