In computational complexity theory, amortized analysis is the time per operation averaged over a worst_case sequence of operations. Amortized analysis differs from average_case performance in that probability is not involved; amortized analysis guarantees the time per operation over worst-case performance.

There are several techniques used in amortized analysis:

Aggregate analysis 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.

Share your thoughts, questions and commentary here

Want to know more? Search encyclopedia, statistics and forums:

Press Releases |
Feeds |
Contact
The Wikipedia article included on this page is licensed under the
GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m