Interactive DSA Project

Sorting Algorithm
Visualizer

Watch 5 classic sorting algorithms come alive — step by step, in real time. Compare speeds, count swaps, and understand complexity visually.

⇄

Comparisons

↕

Swaps

◷

0.00s

Time

●

Ready

Status

Unsorted Comparing Swapping Pivot Sorted

Array size 40

Speed Medium

Bubble Sort

Repeatedly steps through the list, compares adjacent elements and swaps them if they're in the wrong order. The largest unsorted element "bubbles up" to its correct position each pass.

Time & Space Complexity

Best case O(n)

Average O(n²)

Worst case O(n²)

Space O(1)

How it works

Compare two adjacent elements
Swap them if the left is greater
Repeat until the end of the pass
Each pass "bubbles up" the largest element
Stop when no swaps occur in a pass

Built by Divyanshu · DA-IICT

GitHub LinkedIn Email

Sorting Algorithm
Visualizer

Developer

Tech Stack

Sorting Algorithm Visualizer

Sorting Algorithm
Visualizer