Math 2.0

Computer science Algorithms as mathematical objects Concept

Amortized analysis

Summary

Amortized analysis bounds the total cost of a sequence of operations on a data structure, rather than the cost of each operation alone. An occasional expensive operation is paid for by many cheap ones. So the worst-case average cost per operation over a sequence can be much smaller than the worst single cost. The main techniques are the aggregate method, the accounting method and the potential method.

Further reading

  1. Web https://en.wikipedia.org/wiki/Amortized_analysis
About this page
TagCPK0J4X52Y
URIm2://CPK0J4X52Y
Kindconcept
WritingW0 stub
MSC68W40, 68P05
SpecializesAnalysis of algorithms
Same as
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions