AlgoVision

Advanced Comparison

Real-time operation comparison: Quick Sort vs Merge Sort

Array Size: 16Algorithms:6
Bubble SortSelection SortInsertion SortMerge SortQuick SortHeap Sort

●Quick Sort

O(n log n)

Comparisons

0

Swaps / Writes

0

Current Step

Quick Sort initialized.

Select a pivot, partition the range, then recurse into both halves.

Efficiency Gap

0.0%

Both algorithms are currently tied on operation count.

Live Telemetry

● Paused

Leader

Tie

Left Ops (Comp + Swaps)

0

Right Ops (Comp + Swaps)

0

Visualization Speed

SlowFast

●Merge Sort

O(n log n)

Comparisons

0

Swaps / Writes

0

Current Step

Merge Sort initialized.

The array is repeatedly split and merged in sorted order.