Amortized analysis

"Amortized" redirects here. For other uses, see Amortization.

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. ^{[1] : 306} As a conclusion: "Amortized analysis is a useful tool that complements other techniques such as worst-case and average-case analysis." ^{[2] : 14  [3]}

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. ^[2]

History

Amortized analysis initially emerged from a method called aggregate analysis, which is now subsumed by amortized analysis. The technique was first formally introduced by Robert Tarjan in his 1985 paper Amortized Computational Complexity, ^[1] which addressed the need for a more useful form of analysis than the common probabilistic methods used. Amortization was initially used for very specific types of algorithms, particularly those involving binary trees and union operations. However, it is now ubiquitous and comes into play when analyzing many other algorithms as well. ^[2]

Method

Main articles: Accounting method (computer science) and Potential method

Amortized analysis requires knowledge of which series of operations are possible. This is most commonly the case with data structures, which have state that persists between operations. The basic idea is that a worst-case operation can alter the state in such a way that the worst case cannot occur again for a long time, thus "amortizing" its cost.

There are generally three methods for performing amortized analysis: the aggregate method, the accounting method, and the potential method. All of these give correct answers; the choice of which to use depends on which is most convenient for a particular situation. ^[4]

• Aggregate analysis determines the upper bound T(n) on the total cost of a sequence of n operations, then calculates the amortized cost to be T(n) / n. ^[4]
• The accounting method is a form of aggregate analysis which assigns to each operation an amortized cost which may differ from its actual cost. Early operations have an amortized cost higher than their actual cost, which accumulates a saved "credit" that pays for later operations having an amortized cost lower than their actual cost. Because the credit begins at zero, the actual cost of a sequence of operations equals the amortized cost minus the accumulated credit. Because the credit is required to be non-negative, the amortized cost is an upper bound on the actual cost. Usually, many short-running operations accumulate such credit in small increments, while rare long-running operations decrease it drastically. ^[4]
• The potential method is a form of the accounting method where the saved credit is computed as a function (the "potential") of the state of the data structure. The amortized cost is the immediate cost plus the change in potential. ^[4]

Examples

Dynamic array

Amortized analysis of the push operation for a dynamic array

Consider a dynamic array that grows in size as more elements are added to it, such as ArrayList in Java or std::vector in C++. If we started out with a dynamic array of size 4, we could push 4 elements onto it, and each operation would take constant time. Yet pushing a fifth element onto that array would take longer as the array would have to create a new array of double the current size (8), copy the old elements onto the new array, and then add the new element. The next three push operations would similarly take constant time, and then the subsequent addition would require another slow doubling of the array size.

In general, for an arbitrary number ${\displaystyle n}$ of pushes to an array of any initial size, the times for steps that double the array add in a geometric series to ${\displaystyle O(n)}$, while the constant times for each remaining push also add to ${\displaystyle O(n)}$. Therefore the average time per push operation is ${\displaystyle O(n)/n=O(1)}$. This reasoning can be formalized and generalized to more complicated data structures using amortized analysis. ^[4]

Queue

Shown is a Python3 implementation of a Queue, a FIFO data structure:

classQueue:# Initialize the queue with two empty listsdef__init__(self):self.input=[]# Stores elements that are enqueuedself.output=[]# Stores elements that are dequeueddefenqueue(self,element):self.input.append(element)# Append the element to the input listdefdequeue(self):ifnotself.output:# If the output list is empty# Transfer all elements from the input list to the output list, reversing the orderwhileself.input:# While the input list is not emptyself.output.append(self.input.pop())# Pop the last element from the input list and append it to the output listreturnself.output.pop()# Pop and return the last element from the output list

The enqueue operation just pushes an element onto the input array; this operation does not depend on the lengths of either input or output and therefore runs in constant time.

However the dequeue operation is more complicated. If the output array already has some elements in it, then dequeue runs in constant time; otherwise, dequeue takes ⁠${\displaystyle O(n)}$⁠ time to add all the elements onto the output array from the input array, where n is the current length of the input array. After copying n elements from input, we can perform n dequeue operations, each taking constant time, before the output array is empty again. Thus, we can perform a sequence of n dequeue operations in only ⁠${\displaystyle O(n)}$⁠ time, which implies that the amortized time of each dequeue operation is ⁠${\displaystyle O(1)}$⁠. ^[5]

Alternatively, we can charge the cost of copying any item from the input array to the output array to the earlier enqueue operation for that item. This charging scheme doubles the amortized time for enqueue but reduces the amortized time for dequeue to ⁠${\displaystyle O(1)}$⁠.

Common use

• In common usage, an "amortized algorithm" is one that an amortized analysis has shown to perform well.
• Online algorithms commonly use amortized analysis.

References

1. Tarjan, Robert Endre (April 1985). "Amortized Computational Complexity" (PDF). SIAM Journal on Algebraic and Discrete Methods. 6 (2): 306–318. doi:10.1137/0606031. Archived (PDF) from the original on 26 February 2015. Retrieved 9 June 2024.
2. Rebecca Fiebrink (2007), Amortized Analysis Explained (PDF), archived from the original (PDF) on 20 October 2013, retrieved 3 May 2011
3. "Lecture 18: Amortized Algorithms". CS312 -Data Structures and Functional Programming. Cornell University. 2006. [Amortized analysis] is different from what is commonly referred to as average case analysis, because amortized analysis does not make any assumption about the distribution of the data values, whereas average case analysis assumes the data are not "bad" (e.g., some sorting algorithms do well on "average" over all input orderings but very badly on certain input orderings). That is, amortized analysis is a worst case analysis, but for a sequence of operations, rather than for individual operations.
4. Kozen, Dexter (Spring 2011). "CS 3110 Lecture 20: Amortized Analysis". Cornell University . Retrieved 14 March 2015.
5. Grossman, Dan. "CSE332: Data Abstractions" (PDF). cs.washington.edu. Retrieved 14 March 2015.

Literature

• "Lecture 7: Amortized Analysis" (PDF). Carnegie Mellon University . Retrieved 14 March 2015.
• Allan Borodin and Ran El-Yaniv (1998). Online Computation and Competitive Analysis. pp. 20, 141.