Skip to main content

Big-O Complexity Cheatsheet

Learning Playground

Interactive Big-O complexity reference for data structures, sorting algorithms, and graph algorithms. Color-coded and searchable.

Data Structure Operations

Data StructureAccessSearchInsertDeleteSpace
ArrayO(1)O(n)O(n)O(n)O(n)
Sorted ArrayO(log n)O(log n)O(n)O(n)O(n)
Linked ListO(n)O(n)O(1)O(1)O(n)
Doubly Linked ListO(n)O(n)O(1)O(1)O(n)
StackO(n)O(n)O(1)O(1)O(n)
QueueO(n)O(n)O(1)O(1)O(n)
Hash TableO(1)O(1)O(1)O(1)O(n)
BST (balanced)O(log n)O(log n)O(log n)O(log n)O(n)
BST (worst)O(n)O(n)O(n)O(n)O(n)
Min/Max HeapO(n)O(n)O(log n)O(log n)O(n)
TrieO(k)O(k)O(k)O(k)O(n·k)
Graph (adj list)O(V+E)O(1)O(E)O(V+E)
Graph (adj matrix)O(1)O(V²)O(1)O(1)O(V²)

Sorting Algorithm Complexities

AlgorithmBestAverageWorstSpaceStable
Bubble SortO(n)O(n²)O(n²)O(1)Yes
Selection SortO(n²)O(n²)O(n²)O(1)No
Insertion SortO(n)O(n²)O(n²)O(1)Yes
Merge SortO(n log n)O(n log n)O(n log n)O(n)Yes
Quick SortO(n log n)O(n log n)O(n²)O(log n)No
Heap SortO(n log n)O(n log n)O(n log n)O(1)No
Counting SortO(n+k)O(n+k)O(n+k)O(k)Yes
Radix SortO(n·k)O(n·k)O(n·k)O(n+k)Yes
Tim SortO(n)O(n log n)O(n log n)O(n)Yes
Bucket SortO(n+k)O(n+k)O(n²)O(n)Yes

Graph Algorithm Complexities

AlgorithmTimeSpace
BFSO(V+E)O(V)
DFSO(V+E)O(V)
DijkstraO((V+E) log V)O(V)
Bellman-FordO(V·E)O(V)
Floyd-WarshallO(V³)O(V²)
Prim's MSTO((V+E) log V)O(V)
Kruskal's MSTO(E log E)O(V)
Topological SortO(V+E)O(V)
A* SearchO(E)O(V)