Algorithm visualizer
Insertion Sort
Builds a sorted prefix by inserting each new value where it belongs.
Run
Step through the array
It behaves like sorting cards in your hand: shift larger cards aside and insert the key.
Step 1 / 64: Treat the first value as a sorted prefix, then insert each next value into that prefix.
0%