/ Published in: C++
Fibonacci series implementation in c++ , dynamic programming
Expand |
Embed | Plain Text
#include <iostream> using namespace std; long int fibo(int n){ long prethodni=0, trenutni=1; if(n == 0) return 0; else if (n == 1) return 0; for(int i=1; i<n;i++){ long novi = prethodni + trenutni; prethodni = trenutni; trenutni = novi; } return trenutni; } int main(){ cout << "Koji clan fibonaccijevog niza zelite izracunati? "; int n; cin >> n; cout << "\nTaj clan iznosi: " << fibo(n) << endl; cin >> n; return 0; }
You need to login to post a comment.
