Introduction to Algorithm Analysis

Algorithm analysis can feel abstract until students experience it through movement and comparison. Active learning turns the abstract idea of ‘how many steps’ into something they can see, count, and feel, which builds lasting understanding of efficiency. Stepping away from screens for a moment lets students internalize why some solutions scale and others don’t, making the concept stick before formal notation arrives.

• 10th Grade
• Computer Science
• 4 activities
• 20 min–45 min

Learning Objectives

1. Calculate the number of operations for simple algorithms using step counting.
2. Compare the efficiency of two algorithms for the same task by analyzing their step counts.
3. Evaluate the importance of algorithm efficiency for large datasets.
4. Justify the selection of one algorithm over another based on efficiency analysis.

Think-Pair-Share

⏱ 25 min·Pairs

Think-Pair-Share: Race the Algorithm

Students each receive a list of 20 numbers and a task (find the largest). Individually, they count the steps their approach takes, then pair up and compare counts. Pairs share with the class to surface that different correct algorithms can have very different step counts for the same problem.

Prepare & details

Evaluate the importance of efficiency in algorithm design.

Facilitation Tip: During the Race the Algorithm activity, assign each pair a role: one person reads the algorithm aloud while the other physically steps through the operations with cards or counters, ensuring both partners see every operation.

Setup: Standard classroom seating; students turn to a neighbor

Materials: Discussion prompt (projected or printed), Optional: recording sheet for pairs

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

Gallery Walk

⏱ 45 min·Small Groups

Gallery Walk: Algorithm Efficiency Posters

Groups of 3-4 each receive a different simple algorithm (summing a list, finding a minimum, checking for duplicates). They create a poster showing step counts for inputs of size 5, 10, and 20, then draw a graph. The gallery walk reveals how growth patterns differ across algorithms and invites cross-group comparisons.

Prepare & details

Compare the performance of two simple algorithms using step counting.

Facilitation Tip: For the Gallery Walk, place a timer at each poster so students practice staying focused on efficiency rather than aesthetics when giving feedback.

Setup: Wall space or tables arranged around room perimeter

Materials: Large paper/poster boards, Markers, Sticky notes for feedback

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

Socratic Seminar

⏱ 30 min·Whole Class

Socratic Seminar: When Does Efficiency Matter?

Present three scenarios: searching 10 contacts on a phone, searching 2 billion records in a database, running a sorting routine once vs. 10,000 times per day. Students discuss when it is worth optimizing and when 'good enough' is fine, building the engineering judgment that formal analysis later supports.

Prepare & details

Justify why some algorithms are preferred over others for specific tasks.

Facilitation Tip: In the Socratic Seminar, wait exactly three seconds after asking a question before calling on someone to give quieter students time to prepare their thoughts.

Setup: Chairs arranged in two concentric circles

Materials: Discussion question/prompt (projected), Observation rubric for outer circle

• Analyze
• Evaluate
• Create
• Social Awareness
• Relationship Skills

Role Play

⏱ 20 min·Whole Class

Role Play: Be the Algorithm

Assign students roles as data items and have two student-volunteers act as different algorithms, physically processing the data. The class counts steps in real time for both approaches and records the difference. Makes abstract step-counting concrete and memorable before students encounter formal notation.

Prepare & details

Evaluate the importance of efficiency in algorithm design.

Facilitation Tip: During the Role Play activity, have students periodically pause to count their total steps out loud so the group can track cumulative operations.

Setup: Open space or rearranged desks for scenario staging

Materials: Character cards with backstory and goals, Scenario briefing sheet

• Apply
• Analyze
• Evaluate
• Social Awareness
• Self-Awareness

Teaching This Topic

Teachers should start with concrete, relatable examples before moving to notation. Use everyday tasks like searching for a book in a library or sorting socks to introduce the idea of counting steps. Avoid rushing to Big-O notation; let students discover the need for it through frustration with inefficient methods first. Research shows that when students physically simulate algorithms, they retain the concepts longer than when they only analyze pseudocode on paper.

What to Expect

By the end of these activities, students will confidently distinguish between algorithmic efficiency and runtime speed. They will use step counting to compare solutions, explain why efficiency matters in real systems, and justify choices based on evidence from their own comparisons. Successful learning shows up as clear explanations, accurate step tallies, and thoughtful discussions about trade-offs.

Watch Out for These Misconceptions

Common Misconception

During the Role Play activity, watch for students who assume that a faster computer will save an inefficient algorithm.

What to Teach Instead

Pause the role play when students reach large input sizes and ask them to recount their steps out loud while physically slowing down their movements to show how hardware speed doesn’t change the step count.

Common Misconception

During the Race the Algorithm activity, watch for students who confuse step count with actual runtime.

What to Teach Instead

Have students run both algorithms on the same device and record both the step count and the actual runtime, then compare the two sets of numbers to highlight the difference between hardware-dependent and hardware-independent measures.

Assessment Ideas

Quick Check

After the Race the Algorithm activity, provide two simple algorithms and ask students to write the step count for each at n=5 and n=10, then identify which appears more efficient and explain their reasoning in one sentence.

Discussion Prompt

During the Socratic Seminar, pose the question: ‘Imagine you are designing a system to recommend movies to millions of users. Why is algorithm efficiency critical for this application? What might happen if your recommendation algorithm is too slow?’ Use student responses to assess their grasp of efficiency’s real-world impact.

Exit Ticket

After the Role Play activity, give students a short pseudocode snippet with a simple loop. Ask them to: 1. Identify the main operation being counted. 2. Write the step count in terms of ‘n’. 3. Explain in one sentence why this count matters for scalability.

Extensions & Scaffolding

• Challenge: Ask students to write a second version of their algorithm that cuts the step count in half, then compare their new step counts and explain the change.
• Scaffolding: Provide a partially completed step-count table for one algorithm, leaving blanks for students to fill in during the Race the Algorithm activity.
• Deeper exploration: Invite students to research how different sorting algorithms behave on nearly-sorted data and present findings using step counts from their own tests.

Key Vocabulary

Algorithm Efficiency	A measure of how well an algorithm performs in terms of time (how long it takes to run) and space (how much memory it uses).
Step Counting	A method for analyzing algorithm efficiency by counting the number of basic operations an algorithm performs for a given input size.
Operation	A single, fundamental computational action performed by an algorithm, such as an arithmetic calculation, a comparison, or an assignment.
Input Size	The number of data items that an algorithm processes, often denoted by 'n', which is used to determine how the number of steps scales.