Algorithms in Motion

You learn on a single through-line: a commerce catalog. First you scan an unsorted list (linear search), then you exploit sorted prices (binary search), then you combine sorted endpoints for promotions (two pointers, sliding window, and beyond). Every trick is still measured against an honest naïve baseline so O(n), O(n log n), and O(log n) describe real work — not textbook labels.

How we teach algorithms

• One story spine: catalog / search / pairs — so "why are we learning this?" always has an answer.
• Interactive labs: guided binary-search practice plus full playgrounds where you drive the state.
• Invariants in plain English: we name what is true before and after each loop iteration.
• Worked examples in Java with complexity analysis that answers "how much does this cost?"
• Honest trade-offs: when to reach for the pattern, and when to leave it on the shelf.

What you will actually be able to do

• Write linear search, binary search, two-pointer, and sliding-window code confidently.
• Explain why sorted input changes everything — and what "sorted" really buys you.
• Analyze bubble, insertion, selection, merge, and quicksort and know when each wins.
• Apply BFS to shortest-path problems on grids with clean queue discipline.
• Spot the "binary search on the answer" pattern in unfamiliar problems.

Prerequisites

Comfort with basic Java (arrays, loops, methods). No prior algorithm-course experience required — this track builds intuition from scratch and then formalizes it.