Algorithm Trace Visualiser

Run bubble, insertion and merge sorts or binary search one reversible operation at a time, with the active pseudocode line and exact array state always visible.

Model presets

Reviewed starting states

Bubble sort · step 0 of 37

Initial array

Bubble sort will compare adjacent values from left to right.

Comparisons: 0
Writes: 0

1repeat a pass through the unsorted values
2if values[i] > values[i + 1]
3swap values[i] and values[i + 1]
4mark the largest remaining value as sorted
5stop when a pass makes no swaps

Exam trace note

Write the array only after the highlighted operation. Do not skip a comparison simply because no value moved.

Timeline

Step 0 of 37

Current step: 0.00
Final step: 37.0
Comparisons: 0.00
Array writes: 0.00
Pass / range: 0.00
Active left index: -1.00
Active right index: -1.00
Found index: -1.00
Array ordered: 0.00
Trace complete: 0.00

Curriculum map

AQA GCSE Computer Science
Algorithms → Searching, sorting and tracing algorithms
OCR GCSE Computer Science
Algorithms → Standard searching and sorting algorithms
OCR A-Level Computer Science
Algorithms → Algorithm tracing, complexity and comparison

Model boundaries

Datasets are fixed reviewed examples with seven integer values so every trace remains inspectable.
Bubble sort uses an early-stop flag; insertion sort uses a left-to-right sorted prefix; merge sort uses stable ≤ comparison.
Binary search displays an ascending copy of the selected dataset because the method requires ordered input.
A swap counts as two writes; merge-sort writes count copy-back assignments to the main array.

StudyVector-authored deterministic traces of standard GCSE and A-Level searching and sorting algorithms; mapped to the reviewed curriculum topics shown below.

Accessible text description

Seven numbered array cells and proportional bars show the current algorithm state. Orange cells are active, cyan outlines identify the compared positions and green cells are proven sorted. Binary search adds low, middle and high markers over its ordered input. A temporary-storage row appears during merge and insertion operations. Beneath the visual, the active pseudocode line, narration, comparison count and write count update for every reversible step. Previous and Next buttons provide a complete non-animated route through the trace.