<?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="Algorithmic efficiency - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=algorithmic_efficiency&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=algorithmic_efficiency&amp;p=3">3.Next</a>
</p>
<p>as <a href="page.php?w=time_complexity">time</a> and <a href="page.php?w=space_complexity">space</a> complexity cannot be compared directly, so which of two algorithms is considered to be more efficient often depends on which measure of efficiency is considered most important.</p>

<p>For example, <a href="page.php?w=cycle_sort">cycle sort</a> and <a href="page.php?w=Timsort">Timsort</a> are both <a href="page.php?w=sorting_algorithm">algorithms to sort a list</a> of items from smallest to largest. Cycle sort organizes the list in time proportional</p><p>
<a accesskey="1" href="page.php?w=algorithmic_efficiency&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=algorithmic_efficiency&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
