loading…
Skip to content
Edu
CS
Map
Tree
Simulators
Practice
Journal
Dashboard
⌘K
visualizer, B2.4.2 / B2.4.3
Sorting & searching, one comparison at a time
Every step is one row of an exam trace table.
Read the theory
Bubble sort
Selection sort
Linear search
Binary search
5
0
3
1
8
2
1
3
2
4
Next: compare positions 0 and 1. Will they swap?
Swap
No swap
Restart
New numbers
predict each compare
Before it finishes: how many comparisons will the whole sort make?
Ask CSBot
Stuck or curious? CSBot can see this simulator and coaches your next step, it never just answers.