Computer Science · 11th Grade

Active learning ideas

Problem-Solving Strategies: Divide and Conquer

Active learning works for divide and conquer because the strategy requires students to physically break problems apart and see how smaller pieces fit back together. When students manipulate visual representations and discuss their reasoning, they move from abstract thinking to concrete understanding of how decomposition simplifies complex problems.

• Common Core State Standards
• CSTA: 3B-AP-12

• 20–35 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Case Study Analysis
• 35 min · Small Groups

Problem Decomposition Workshop: Break It Down

Small groups receive novel problems (sorting a school library, organizing a single-elimination tournament, finding a bug in a codebase) and must identify a divide-and-conquer approach before implementing. Groups post their decomposition strategy for class critique before any code is written.

Explain the 'divide and conquer' strategy in algorithmic problem-solving.

Facilitation Tip

During the Problem Decomposition Workshop, circulate and ask students to explain their smallest possible subproblem before they move to combining steps.

What to look for

Present students with a problem like 'finding the largest number in a list'. Ask them to write down the 'divide' step, the 'conquer' step (including the base case), and the 'combine' step for this problem.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

Activity 02

• Case Study Analysis
• 25 min · Pairs

Diagram Activity: Recursion Tree Mapping

Pairs draw divide-and-conquer recursion trees for three different algorithms they have studied (Merge Sort, binary search, Quick Sort), then compare the tree structures side by side. Partners identify what is similar across trees and what distinguishes each algorithm's decomposition pattern.

Analyze how this strategy is applied in algorithms like Merge Sort.

Facilitation Tip

For Recursion Tree Mapping, model how to label each level of the tree with the divide and combine steps to make the recursive structure visible.

What to look for

Pose the question: 'When might a divide and conquer approach NOT be the most efficient strategy for solving a problem?' Guide students to consider problems where the overhead of recursion or the difficulty of combining subproblem solutions outweighs the benefits.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

Activity 03

• Think-Pair-Share
• 20 min · Pairs

Think-Pair-Share: Recognize the Pattern

Provide descriptions of four algorithms without naming them. Students identify which ones use divide and conquer and explain their reasoning, pointing to the subproblem structure and combine step. Pairs share before the class discusses borderline cases together.

Design a simple problem solution using the divide and conquer approach.

Facilitation Tip

In the Think-Pair-Share, listen for students using precise language like 'base case' and 'combine operation' when describing their patterns.

What to look for

Provide students with a pseudocode snippet for Merge Sort. Ask them to identify the 'divide' step, the 'conquer' step (recursive calls), and the 'combine' step (merge operation) within the code.

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

Activity 04

• Gallery Walk
• 30 min · Small Groups

Gallery Walk: Divide and Conquer in the Wild

Set up stations around the room with real examples of divide and conquer: binary search, Merge Sort, the Fast Fourier Transform, DNS lookup, and tournament brackets. Groups annotate each station by identifying the divide step, the conquer step, and the combine step.

Explain the 'divide and conquer' strategy in algorithmic problem-solving.

What to look for

Present students with a problem like 'finding the largest number in a list'. Ask them to write down the 'divide' step, the 'conquer' step (including the base case), and the 'combine' step for this problem.

• Understand
• Apply
• Analyze
• Create
• Relationship Skills
• Social Awareness

A few notes on teaching this unit

Teach divide and conquer by starting with problems students can solve by hand, then gradually introducing pseudocode. Avoid rushing to recursion—focus first on decomposition, then show how recursion can model the same process. Research shows that students grasp the pattern better when they see multiple implementations of the same algorithm, so compare iterative and recursive solutions side by side.

Successful learning looks like students confidently identifying how to split a problem, solving subproblems independently, and correctly combining results to form the final solution. You will observe students articulating the divide, conquer, and combine steps in their own words and applying the pattern to new scenarios.

---

Watch Out for These Misconceptions

• During Problem Decomposition Workshop, watch for students assuming that divide and conquer always requires recursion because they only see recursive examples.

  Use the decomposition worksheet to have students write both recursive and iterative pseudocode for the same problem, explicitly labeling the base case and loop structure to separate the pattern from the technique.

• During Think-Pair-Share: Recognize the Pattern, students may claim divide and conquer only applies to sorting algorithms like Merge Sort.

  Have students list algorithms they’ve learned and categorize each as divide and conquer or not, using the gallery walk posters to see examples outside of sorting such as binary search and FFT.

• During Gallery Walk: Divide and Conquer in the Wild, students might believe breaking a problem always speeds up the solution.

  Assign each group a problem from the gallery walk and ask them to calculate the time complexity of solving it directly versus using divide and conquer, focusing on the combine step’s cost.

---

Methods used in this brief

• Case Study Analysis
• Think-Pair-Share
• Gallery Walk