Advertisement
amermo

Samostalni 6 - Z6 - dio sa fibonacijem

Apr 11th, 2015
219
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.51 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. int Fibonacci(int n)
  4. {
  5.     if(n == 1)
  6.         return 0;
  7.     if(n == 2)
  8.         return 1;
  9.     else return Fibonacci(n-1) + Fibonacci(n-2);
  10. }
  11.  
  12. int *DinamickiFibo(int n)
  13. {
  14.     int *pok(new int[n]);
  15.     for(int i(0); i < n; i++)
  16.         pok[i] = Fibonacci(i+1);
  17.     return pok;
  18. }
  19.  
  20. int main()
  21. {
  22.     int n;
  23.     std::cout << "Unesite n: ";
  24.     std::cin >> n;
  25.     int *p(DinamickiFibo(n));
  26.     for(int i(0); i < n; i++)
  27.         std::cout << p[i] << " ";
  28.     delete[] p;
  29.     return 0;
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement