Sorting Algorithm Visualizer

Compare and visualize different sorting algorithms

Algorithm

Array Size: 20

Speed: 50%

Custom Input (comma-separated numbers)

Comparisons

Swaps

Array Accesses

Time Elapsed

0ms

Repeatedly steps through the list, compares adjacent elements and swaps them if they are in wrong order.

Best: O(n)

Average: O(n²)

Worst: O(n²)

Space: O(1)

Stable: Yes

Default

Comparing

Swapping

Sorted

Current

Pivot