DSA Foundations · Foundations

What Is an Algorithm?

Algorithms are precise problem-solving procedures. Students learn how to describe steps clearly, check correctness, and compare multiple ways to solve the same task.

Student Focus

Sessions emphasize plain-English explanations before code so students can defend the idea behind a solution.

Guided Lesson Notes

How Code Scholars teaches What Is an Algorithm?

This guide helps students understand the idea, implement it carefully, explain the runtime, and recognize when the pattern belongs in a larger problem.

In a session, students usually start with a small trace, then write or review code, then test edge cases. The final step is a short explanation: what the structure or algorithm stores, why it is correct, and what changes when the input grows.

Key Ideas

  • Inputs, outputs, and preconditions
  • Correctness before speed
  • Pseudocode and trace tables

Practice Prompts

  • Write pseudocode for finding the first duplicate in a list.
  • Trace two algorithms on the same input and explain where their behavior differs.

Tutoring Connection

Turn the topic into usable problem-solving skill

Students can use this page before a lesson, after a difficult homework assignment, or while preparing for AP Computer Science A extensions, Advanced Topics in CS, USACO growth, or a college data structures course.