Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- int Fibonacci(int n)
- {
- if(n == 1)
- return 0;
- if(n == 2)
- return 1;
- else return Fibonacci(n-1) + Fibonacci(n-2);
- }
- int *DinamickiFibo(int n)
- {
- int *pok(new int[n]);
- for(int i(0); i < n; i++)
- pok[i] = Fibonacci(i+1);
- return pok;
- }
- int main()
- {
- int n;
- std::cout << "Unesite n: ";
- std::cin >> n;
- int *p(DinamickiFibo(n));
- for(int i(0); i < n; i++)
- std::cout << p[i] << " ";
- delete[] p;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement