In
computer science,
amortized analysis is a method for
analyzing a given algorithm's
time complexity, or how much of a resource, especially time or memory in the context of computer programs, it takes to
execute. The motivation for amortized analysis is that looking at the worst-case run time
per operation can be too pessimistic.