<?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="Search algorithm - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Search_algorithm&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Search_algorithm&amp;p=4">3.Next</a>
</p>
<p>and <a href="page.php?w=database_index">database index</a>es.</p>

<p>Search algorithms can be classified based on their mechanism of searching into three types of algorithms: linear, binary, and hashing. <a href="page.php?w=Linear_search">Linear search</a> algorithms check every record for the one associated with a target key in a linear fashion. <a href="page.php?w=Binary_search_algorithm">Binary, or half-interval, searches</a> repeatedly target the center of the search structure and divide the search space in half. Comparison search algorithms</p><p>
<a accesskey="1" href="page.php?w=Search_algorithm&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Search_algorithm&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
