Algorithms

An algorithm is a repeatable sequence of steps used to solve a problem. This section focuses on understanding why a solution works and how it scales.

Start here

Big O notation — Compare growth rates with an interactive chart.
Binary search — Walk through each comparison in a sorted array.

What you’ll learn

Question	Why it matters
Is the solution correct?	Tests that the algorithm produces the right answer.
How does it scale?	Predicts how runtime or memory grows with input size.
Is there a better approach?	Reveals trade-offs between algorithms and data structures.