algorithm analysis si ei size list contents table using the aggregate method to compute the total run time for sequence of append operations vary in which many of the operations in the sequence contribute little cost and only few operations contribute high cost to the overall time this is exactly the case with the append(method in long sequence of append operationsonly few instances require ( )while many of them are ( the amortized cost can only be used for long sequence of append operations if an algorithm used single append operationthe cost for that one operation is still (nin the worst case since we do not know if that' the instance that causes the underlying array to be expanded caution amortized cost is not average case time do not confuse amortized cost with that of average case time in average case analysisthe evaluation is done by computing an average over all possible inputs and sometimes requires the use of statistics amortized analysis computes an average cost over sequence of operations in which many of those operations are "cheapand relatively few are "expensivein terms of contributing to the overall time