<?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="Sorting algorithm - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Sorting_algorithm&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Sorting_algorithm&amp;p=6">3.Next</a>
</p>
<p>century new algorithms are still being invented, with the widely used <a href="page.php?w=Timsort">Timsort</a> dating to 2002, and the <a href="page.php?w=library_sort">library sort</a> being first published in 2006.</p>

<p>Comparison sorting algorithms have a fundamental requirement of  comparisons. Algorithms not based on comparisons, such as <a href="page.php?w=counting_sort">counting sort</a>, can have better performance.</p>

<p>Sorting algorithms are prevalent in introductory <a href="page.php?w=computer_science">computer science</a> classes,</p><p>
<a accesskey="1" href="page.php?w=Sorting_algorithm&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Sorting_algorithm&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
