Amortized Analysis
What is amortized analysis?
A method of analyzing algorithms that considers the entire sequence of operations of the program. It allows for the establishment of a worst-case bound for the performance of an algorithm irrespective of the inputs by looking at all of the operations. [Wikipedia]
What is aggregate analysis?
A method that shows that for all n, a sequence of n operations takes worst-case time t(n). In the worst case, the average cost, or amortized cost, per operation si there fore T(n) / n. [p452]
What is an advantage of using amortized analysis?
An advantage of using this algorithm is that although some operations might be expensive, many others might be cheap. In other words, many of the operations might run well under the worst-case time. [p358]
What is the use of amortized analysis?
We use these algorithms to analyze certain algorithms that perform a sequence of similar operations. [p358]
What does it mean to contract?
[p]
What is a credit?
[p]
What is a potential function?
[p]
What is an amortized cost?
[p]
What is elementary insertion?
[p]
What is expansion
[p]
What is the accounting method?
[p]
What is the potential method?
[p]
What is the potential?
[p]
