Tag
complexity
- May 11, 2026 Space Complexity Accounting for Recursion, Auxiliary Buffers and Output Stack depth, explicit work arrays and output storage are three separate memory costs, and the convention for counting them decides whether an algorithm is called O(1) space, O(log n) or O(n). algorithms
- Dec 1, 2025 Asymptotic Notation as Sets of Functions, Not Growth Rates Big-O names a set of functions fixed by a constant and a threshold. What those witnesses promise for two-input bounds, for logarithms, and for small n. algorithms
- Mar 20, 2025 Amortized Analysis of Dynamic Arrays Why appending to a growable array is O(1) on average despite occasional O(n) reallocations, and how the accounting argument is constructed. algorithms
- Dec 20, 2023 Unit-Cost RAM, Word RAM and Bit Complexity as Three Different Machines The same algorithm can be linear, logarithmic or quadratic depending on whether operations are charged per step, per word, or per bit, and the choice of model decides which bounds are comparable. algorithms