Metraipolis › archive › dc_a60db96940ca

Amortized analysis — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Amortized_analysis
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-08T23:02:42.766Z
SHA-256 of the archived text
a7d794101e9f7fc105d4e66b106ef6ea09ab5cbedc901a81b81ee2a91e50931b
Stable URL of this page
https://metraipolis.com/documento/dc_a60db96940ca

How to cite

Amortized analysis — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Amortized_analysis (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a60db96940ca (Metraipolis archive dc_a60db96940ca, sha256 a7d794101e9f7fc105d4e66b106ef6ea09ab5cbedc901a81b81ee2a91e50931b)
BibTeX
@misc{dca60db96940ca,
  title = {Amortized analysis — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Amortized_analysis},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a60db96940ca; sha256 a7d794101e9f7fc105d4e66b106ef6ea09ab5cbedc901a81b81ee2a91e50931b},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Amortized_analysis. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, amortized analysis is a method for analyzing a given algorithm's complexity, or how much of a resource, especially time or memory, it takes to execute. The motivation for amortized analysis is that looking at the worst-case run time can be too pessimistic. Instead, amortized analysis averages the running times of operations in a sequence over that sequence. As a conclusion: "Amortized analysis is a useful tool that complements other techniques such as worst-case and average-case analysis." For a given operation of an algorithm, certain situations (e.g., input parametrizations or data structure contents) may imply a significant cost in resources, whereas other situations may not be as costly. The amortized analysis considers both the costly and less costly operations together over the whole sequence of operations. This may include accounting for different types of input, length of the input, and other factors that affect its performance.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Amortized analysis» — https://en.wikipedia.org/wiki/Amortized_analysis
Wikidata Q331716: «method for algorithm analysis in computer science» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q331716
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Amortized_analysis?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1380651778, consultata il 2026-11-08T22:58:50.532Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 33d57ce426020242b2c464c3e196e5a82dd28d5708d9905902e52011e67e1dff