Algorithm Visualization

Understand classic algorithms through interactive animations

13
Total Algorithms
5
Categories

Sorting Algorithms

Array element arrangement

Bubble Sort

O(n²) | O(1)

Compare adjacent elements, larger floats up

Heap Sort

O(n log n) | O(1)

Uses binary heap properties for sorting

Quick Sort

O(n log n) | O(log n)

Divide and conquer with pivot partitioning

Merge Sort

O(n log n) | O(n)

Divide into subarrays then merge

String Algorithms

Sequence matching and comparison

Myers Diff

O((N+M)D) | O(N+M)

Minimum edit distance, Git diff core

LCS Subsequence

O(MN) | O(MN)

DP for longest common subsequence

KMP Matching

O(N+M) | O(M)

Prefix table accelerates string matching

Graph Algorithms

Graph traversal and pathfinding

Dijkstra

O((V+E)logV) | O(V)

Single-source shortest path algorithm

BFS/DFS

O(V+E) | O(V)

Breadth/depth first traversal comparison

A* Pathfinding

O(E) | O(V)

Heuristic shortest path search

Search & Optimization

Efficient search and decision optimization

Binary Search

O(log n) | O(1)

Efficient search in sorted array

0/1 Knapsack

O(NW) | O(NW)

Classic DP optimization problem

Computational Geometry

Geometric shapes and spatial computation

Convex Hull

O(n log n) | O(n)

Graham Scan for point set convex hull

Data Structures

Efficient storage and retrieval

B-Tree

O(log n) | O(n)

Self-balancing multi-way search tree

B+ Tree

O(log n) | O(n)

Database index structure with linked leaves

Skip List

O(log n) | O(n)

Probabilistic multi-level linked list

Want to know how we compare?

In-depth comparison of algo.jsdiff.com with VisuAlgo, USFCA, Toptal and more

View Comparison