Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. ====== Recurențe ====== 1. Folosiți cele 3 metode (metoda arborilor, metoda substituției, teorema master) pentru a rezolva recurențele: * $ T_a(n) = 2T_a(n-1) + 1$ * $ T_b(n) = T_b(n-1) + 1$ * $ T_c(n) = 2T_c(n/2) + \log(n)$ * $ T_d(n) = T_d(n/9) + T_d(8n/9) + n$ * $ T_e(n) = T_e(2n/3) + 1$ * $ T_{Strassen}(n) = 7T_{Strassen}(n/2) + n^2 $\\ Aceasta recurenta descrie [[https://en.wikipedia.org/wiki/Strassen_algorithm| Algoritmul Strassen]] * $ T_{Karatsuba}(n) = 3T_{Karatsuba}(n/2) + 1 $\\ Aceasta recurenta descrie [[https://en.wikipedia.org/wiki/Karatsuba_algorithm| Algoritmul Karatsuba]] * $ T_{Quicksort}(n) = T_{Quicksort}(n-1) + O(n) $\\ Aceasta recurenta descrie [[https://en.wikipedia.org/wiki/Quicksort| Algoritmul Quicksort]] <note> Soluțiile acestui laborator se găsesc [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:sol:7|aici]] </note>