Algorithm Showcase

Explore our collection of visual algorithm demonstrations

Bubble Sort

O(n²)

Compare adjacent elements and swap

View Demo →

Quick Sort

O(n log n)

Divide and conquer with pivot

Coming Soon →

Merge Sort

O(n log n)

Split and merge recursively

Coming Soon →

Binary Search

O(log n)
10
25
50
65
85

Halve search space efficiently

View Demo →

Linear Search

O(n)
15
32
47
58
76

Check each element sequentially

Coming Soon →

BFS Traversal

O(V+E)
A
B
C

Explore breadth-first by levels

View Demo →

DFS Traversal

O(V+E)
A
B
C

Explore depth-first recursively

Coming Soon →

Dijkstra's

O(E log V)
0
5
3

Find shortest path efficiently

Coming Soon →