Interactive Timsort. Detect runs already in order, extend short ones with insertion, then merge runs.

Array · n=12 · minrun=4 run (colored) detecting extending merging done
Step 0 / 0Find runs

Press Play. Timsort finds ascending runs, extends short ones, then merges. Already-sorted runs are free.

Speed
runs found
0
merges done
0
phase
Find runs
progress
0%
scan for natural runs (ascending)
if a run is too short
extend it with insertion sort
while more than one run remains:
merge two adjacent runs
one sorted run left → done
timeline0 / 0
←→space  walk steps