<?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="Recurrence relation - Page 32 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Recurrence_relation&amp;p=31">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Recurrence_relation&amp;p=33">3.Next</a>
</p>
<p>at the middle of the vector. If not, then it will check if the middle element is greater or lesser than the sought element. At this point, half of the vector can be discarded, and the algorithm can be run again on the other half. The number of comparisons will be given by</p>

<p>
:<br/>
:</p>

<p>the <a href="page.php?w=time_complexity">time complexity</a> of which will be .</p>

<p><big> Digital signal processing </big></p>
<p>In <a href="page.php?w=digital_signal_processing">digital signal processing</a>, recurrence relations can model feedback in</p><p>
<a accesskey="1" href="page.php?w=Recurrence_relation&amp;p=31">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Recurrence_relation&amp;p=33">3.Next</a>
</p>

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

</card>
</wml>
