Documente Academic
Documente Profesional
Documente Cultură
trebuie sa fie…
Recursia
1
Definitia Recursiei
2
Sirul definit recursiv
Ex:
a0 = 1
an+1 = 2an for n = 0, 1, 2, …
3
Definirea Functiei recursive
Putem folosi urmatoarele metode pentru a define
functia recursiv:
f(0) = 3
f(n + 1) = 2f(n) + 3
f(0) = 3
f(1) = 2f(0) + 3 = 23 + 3 = 9
f(2) = 2f(1) + 3 = 29 + 3 = 21
f(3) = 2f(2) + 3 = 221 + 3 = 45
f(4) = 2f(3) + 3 = 245 + 3 = 93
5
Functia definita recursiv
Cum putem define functia f(n) = n! recursiv ?
f(0) = 1
f(n + 1) = (n + 1)f(n)
f(0) = 1
f(1) = 1f(0) = 11 = 1
f(2) = 2f(1) = 21 = 2
f(3) = 3f(2) = 32 = 6
f(4) = 4f(3) = 46 = 24
6
Functiile definita recursiv
Exemplu faimos: Numerele Fibonacci
f(0) = 0, f(1) = 1
f(n) = f(n – 1) + f(n - 2)
f(0) = 0
f(1) = 1
f(2) = f(1) + f(0) = 1 + 0 = 1
f(3) = f(2) + f(1) = 1 + 1 = 2
f(4) = f(3) + f(2) = 2 + 1 = 3
f(5) = f(4) + f(3) = 3 + 2 = 5
f(6) = f(5) + f(4) = 5 + 3 = 8
7
Recursive Algorithms
Recursive Fibonacci Evaluation:
f(4)
f(3) f(2)
f(2)
f(1) f(1) f(0)
f(1) f(0)