<?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 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=sorting_algorithm&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=sorting_algorithm&amp;p=5">3.Next</a>
</p>
<p>From the beginning of computing, the sorting problem has attracted a great deal of research, perhaps due to the complexity of solving it efficiently despite its simple, familiar statement. Among the authors of early sorting algorithms around 1951 was <a href="page.php?w=Betty_Holberton">Betty Holberton</a>, who worked on <a href="page.php?w=ENIAC">ENIAC</a> and <a href="page.php?w=UNIVAC">UNIVAC</a>. <a href="page.php?w=Bubble_sort">Bubble sort</a> was analyzed as early as 1956. Asymptotically optimal algorithms have been known since the mid-20th</p><p>
<a accesskey="1" href="page.php?w=sorting_algorithm&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=sorting_algorithm&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
