<?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="Hybrid algorithm - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=hybrid_algorithm&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=hybrid_algorithm&amp;p=3">3.Next</a>
</p>
<p>as combinations of simpler pieces - but only to combining algorithms that solve the same problem, but differ in other characteristics, notably performance.</p>

<p><big>Examples</big></p>
<p>In <a href="page.php?w=computer_science">computer science</a>, hybrid algorithms are very common in optimized real-world implementations of <a href="page.php?w=recursive_algorithm">recursive algorithm</a>s, particularly <a href="page.php?w=Divide-and-conquer_algorithm">implementations</a> of <a href="page.php?w=divide-and-conquer_algorithm">divide-and-conquer</a> or</p><p>
<a accesskey="1" href="page.php?w=hybrid_algorithm&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=hybrid_algorithm&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
