/ EXPERIMENTAL WORKSPACE / 01

Make the algorithm
visible.

A working sorting visualizer — inspect the array, step through comparisons, and connect behavior to complexity.

STATEFUL DEMOStep-by-step executionNo code is run on a server.
ALGORITHM PLAYGROUND

Selection sort

STEP 01 / 29

Start with the unsorted array.

TIMEO(n²)Average / worst case
SPACEO(1)In-place sort
LEARNING GOALTrack stateCompare, shift, place
WHY THIS MATTERS

Reason about each operation.

This is a visual teaching aid, not a replacement for analysis. Count comparisons and writes, recognize nested-loop structure, and compare simple algorithms with more efficient approaches for larger inputs.