In computer science, especially in analysis of algorithms, aggregate analysis refers to a technique of amortized analysis. This technique determines the upper bound T(n) on the total cost of a sequence of n operations, then calculates the average cost to be T(n)/n.
