2. Analyse van algoritmen
2. Analyse van algoritmen
2. Analyse van algoritmen
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Rekenregels<br />
1. f(n) = Θ(g(n)) ∧ g(n) = Θ(h(n))<br />
⇒ f(n) = Θ(h(n))<br />
<strong>2.</strong> f(n) = Θ(k × g(n)), voor constante k<br />
⇒ f(n) = Θ(g(n))<br />
3. f1(n) = Θ(g1(n)) ∧ f2(n) = Θ(g2(n))<br />
⇒ f1(n) + f2(n) = Θ(max(g1(n),g2(n)))<br />
Cursus Algoritmen en Datastructuren voor Geomatica (2008–2009) – p.18/38