Aesthetic Algorithm
Beautiful visualizations of computer science algorithms
Sorting
Bubble Sort
O(n²)
Insertion Sort
O(n²)
Selection Sort
O(n²)
Merge Sort
O(n log n)
Quick Sort
O(n log n)
Heap Sort
O(n log n)
Shell Sort
O(n log²n)
Counting Sort
O(n+k)
Data Structures
Stack
O(1)
Queue
O(1)
Binary Search Tree
O(log n)
Linked List
O(n)
AVL Tree
O(log n)
Hash Table
O(1)
Red-Black Tree
O(log n)
Splay Tree
O(log n)
Trie
O(m)
B-Tree
O(log n)
Min Heap
O(log n)
Binomial Queue
O(log n)
Fibonacci Heap
O(1) insert
Leftist Heap
O(log n)
Skew Heap
O(log n)
Disjoint Sets
O(α(n))
Huffman Coding
O(n log n)
Graph
Breadth-First Search
O(V+E)
Depth-First Search
O(V+E)
Dijkstra's Algorithm
O((V+E) log V)
Prim's Algorithm
O((V+E) log V)
Kruskal's Algorithm
O(E log E)
Floyd-Warshall
O(V³)
Topological Sort
O(V+E)
Dynamic Programming
Fibonacci (DP)
O(n)
Coin Change
O(n*amount)
Longest Common Subsequence
O(m*n)
Backtracking
N-Queens
O(n!)