Skip to content
← All pathways
Computer ScienceBeginnerRevision 1

Algorithmic Thinking

Learn to compare algorithms honestly: measure growth, watch sorting strategies compete, and trace binary search before choosing an approach.

4 stepsAbout 65 minutesCompare common algorithms using time, space, and input assumptions.

A lab, not a slideshow

How each chapter works

1 · Predict

Commit to what you think the system will do before pressing play.

2 · Observe

Change one variable and watch the state, algorithm, or model respond.

3 · Explain

State the invariant or principle, then prove it in the checkpoint.

Saved learning progress

Your ordered steps

Checking saved progress…

Chapter progress

0%

Next: See how runtime grows

Continue
  1. Next suggested
    Step 1

    Step 1Experiment

    See how runtime grows

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  2. Step 2

    Step 2Experiment

    Compare sorting strategies

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  3. Step 3

    Step 3Experiment

    Trace binary search

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  4. Step 4

    Step 4Prove

    Algorithmic thinking checkpoint

    Use the evidence from the chapter to pass a server-scored knowledge check.

    Take knowledge check