title: What is amortized analysis of algorithms?
body: <p>How is it different from asymptotic analysis? When do you use it, and why?</p>
  
  <p>I've read some articles that seem to have been written well, like these:</p>
  
  <ul>
  <li><p><a href="http://www.ugrad.cs.ubc.ca/~cs320/2010W2/handouts/aa-nutshell.pdf" rel="noreferrer">http://www.ugrad.cs.ubc.ca/~cs320/2010W2/handouts/aa-nutshell.pdf</a></p></li>
  <li><p><a href="http://www.cs.princeton.edu/~fiebrink/423/AmortizedAnalysisExplained_Fiebrink.pdf" rel="noreferrer">http://www.cs.princeton.edu/~fiebrink/423/AmortizedAnalysisExplained_Fiebrink.pdf</a></p></li>
  </ul>
  
  <p>but I've still not understood fully these concepts. </p>
  
  <p>So, can anyone please simplify it for me?</p>