<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Amortized analysis - Page 14 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=amortized_analysis&amp;p=13">1.Previous</a><br />
<a accesskey="3" href="page.php?w=amortized_analysis&amp;p=15">3.Next</a>
</p>
<p>that item.  This charging scheme doubles the amortized time for enqueue but reduces the amortized time for dequeue to .</p>

<p><big> Common use </big></p>
<p>
* In common usage, an "amortized algorithm" is one that an amortized analysis has shown to perform well.<br/>
* <a href="page.php?w=Online_algorithm">Online algorithm</a>s commonly use amortized analysis.</p>

<p><big> References </big></p>
<p><big> Literature </big></p>
<p>
* <br/>
* </p>

<p></p>
<p>
<a accesskey="1" href="page.php?w=amortized_analysis&amp;p=13">1.Previous</a><br />
<a accesskey="3" href="page.php?w=amortized_analysis&amp;p=15">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
