Skip to main content
Stepwise
/Concepts/Big O Notation
1 / 18
Speed
ENES
/
Big O NotationRecursionTwo PointersSliding WindowSpace ComplexityWorst-case AnalysisMemoizationGreedy vs DP
StackQueueLinked ListHash TableBinary Search TreeHeapUnion-Find / Disjoint SetsRed-Black Tree
Bubble SortSelection SortInsertion SortQuick SortMerge SortHeap SortCounting SortRadix SortShell SortBucket Sort
Binary SearchLinear SearchJump SearchInterpolation SearchQuickselect / Median Finding
Breadth-First SearchDepth-First SearchDijkstra's AlgorithmPrim's AlgorithmKruskal's MSTTopological Sort
Fibonacci DPKnapsack 0/1Longest Common Subsequence
N-Queens ProblemSudoku SolverMaze Pathfinding
Tower of Hanoi
Sieve of Eratosthenes
45 algorithms·by Sai Rithwik Kukunuri

Big O Notation — Concepts

Step 1:Big O measures how an algorithm scales. Watch each curve grow as the input size (n) increases.
Variables
complexity==—