Amortized Time Complexity
Amortized time complexity is the average time cost per operation over a worst-case sequence of operations, used to describe algorithms where occasional expensive operations are offset by many cheap ones.
6 resources across 1 library
Glossary Terms(6)
Amortized Time Complexity
Amortized time complexity is the average time cost per operation over a worst-case sequence of operations, used to describe algorithms where occasional expensi…
Space Complexity
Space complexity is a measure, expressed in Big O notation, of how much memory an algorithm requires to run as a function of the size of its input.
Master Theorem
The Master Theorem is a formula that directly determines the asymptotic time complexity of divide-and-conquer recurrences of the form T(n) = aT(n/b) + f(n), wi…
Union-Find Algorithm
Union-Find (also called Disjoint-Set Union or DSU) is a data structure that efficiently tracks a collection of disjoint sets, supporting two core operations: f…
Sliding Window Maximum
Sliding Window Maximum refers to both a classic algorithmic problem — finding the maximum element in every contiguous window of fixed size k as it slides acros…
Knapsack Problem
The Knapsack Problem is a classic optimization problem in which a set of items, each with a weight and a value, must be selected to maximize total value withou…