**Amortized:**

An amortized analysis of algorithms is average of the time required to perform a sequence of data structure operations. The amortized analysis is different from the average case analysis, don't get confused with average case analysis. if we take the average of the sequence of operation, but there are the chances that a single operations cost may be expensive. Most common techniques of amortized analysis are:

```
1. Aggregate Analysis
2. Accounting Method
3. Potential Method.
```

Ex. Suppose we determine T(n) as an upper bound to the total cost of sequence of n operations then the average cost per operation T(n)/n is assigned to the each operation as an amortized cost.

**Asymptotic Analysis**

The asymptotic analysis is the time required by an algorithm to perform a data structure operation over the given data input. It is worst/average/best depends upon on the input.

Ex. A sorting algorithm might be O(nlogn).