|
|
@@ -163,9 +163,11 @@ $$ T(n) \leq O(n) + T(max\{k, n−k\}) \leq O(n) + T(9n/10)$$
|
|
|
|
|
|
Vamos analizar essa recursão, note que colocamos $\leq$ , pois as linhas 3 e 5 do Particione-D podem consumir tempo menor do que as linhas 2 e 4.
|
|
|
|
|
|
-$$T(n) = O(n) + T(9n/10) = an + T(9n/10) $$
|
|
|
+$$T(n) = O(n) + T(9n/10) = an + T(9n/10) = an + an \frac{9}{10} T(n \frac{9}{10}^2) $$
|
|
|
|
|
|
-$$T(n) = O(n) + T(9n/10) = an + T(9n/10) = an + an \frac{9}{10} T(n \frac{9}{10}^2)$$
|
|
|
+$$= an \sum\_{j=1}{i} \frac{9}{10}^{j-1} + T(n \frac{9}{10}^i) = an \cdot \frac{\frac{9}{10}^i-1}{\frac{9}{10}-1} + T(n \frac{9}{10}^i)$$
|
|
|
+
|
|
|
+Suponha que $n = $
|
|
|
|
|
|
|
|
|
|
