Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int FibonacciRek(int);
- int Fibonacci(int);
- int main() {
- int n;
- do {
- cout << "Upisite prirodan broj n: ";
- cin >> n;
- }
- while(n <= 0);
- cout << "Prvih " << n << " clanova Fibonaccijevog niza su: ";
- for(int i = 1; i <= n; i++) {
- cout << Fibonacci(i);
- if(i < n) cout << ", ";
- else cout << ".";
- }
- system("pause>0");
- return 0;
- }
- int FibonacciRek(int n) {
- if(n <= 2)
- return 1;
- return FibonacciRek(n - 1) + FibonacciRek(n - 2);
- }
- int Fibonacci(int n) {
- if(n <= 2)
- return 1;
- int prvi = 1, drugi = 1, trenutni;
- for(int i = 3; i <= n; i++)
- {
- trenutni = prvi + drugi;
- prvi = drugi;
- drugi = trenutni;
- }
- return trenutni;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement