Advertisement
Guest User

Untitled

a guest
Jun 20th, 2019
85
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.85 KB | None | 0 0
  1. #include<iostream>
  2.  
  3. using namespace std;
  4.  
  5. int N;
  6. int Vector[1001];
  7.  
  8. inline void Initializare(int Vector[], int N)
  9. {
  10. for (int i = 0; i <= N; ++i) Vector[i] = -1;
  11. }
  12.  
  13. inline int Fibo_Dinamic_Iterativ(int N)
  14. {
  15. Vector[0] = 0;
  16. Vector[1] = 1;
  17. for (int i = 2; i <= N ; ++i) Vector[i] = Vector[i - 1] + Vector[i - 2];
  18. return Vector[N];
  19. }
  20.  
  21. inline int Fibo_Dinamic_Recursiv(int N)
  22. {
  23. if (Vector[N] == -1) // inseamna ca elementul din pozitia N al sirului lui fibo nu e calculat
  24. {
  25. if (N == 0 || N == 1) Vector[N] = N;
  26. else Vector[N] = Fibo_Dinamic_Recursiv(N - 1) + Fibo_Dinamic_Recursiv(N - 2);
  27.  
  28. }
  29. return Vector[N];
  30. }
  31.  
  32.  
  33.  
  34. inline void READ()
  35. {
  36. cin >> N;
  37. }
  38.  
  39. int main()
  40. {
  41. READ();
  42. cout << Fibo_Dinamic_Iterativ(N);
  43. cout << endl;
  44. Initializare(Vector, N);
  45. cout << Fibo_Dinamic_Recursiv(N);
  46. system("pause");
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement