Showing posts with label non recursive. Show all posts
Showing posts with label non recursive. Show all posts
Fibonacci Calculator in Visual C++
Saliya Ekanayake
#include "stdafx.h"
#include
using namespace std;
int calculate_fibonacci(int n);
int main(int argc, char* argv[])
{
int n;
cout << "Enter n: "; cin >> n;
cout << "Fibonacci of " << int="" b="1," bb="0," return="" else="" if="" n="="> 1) {
for (i = 1; i < result =" 0;" bb =" b;" b =" result;">
#include
using namespace std;
int calculate_fibonacci(int n);
int main(int argc, char* argv[])
{
int n;
cout << "Enter n: "; cin >> n;
cout << "Fibonacci of " << int="" b="1," bb="0," return="" else="" if="" n="="> 1) {
for (i = 1; i < result =" 0;" bb =" b;" b =" result;">
7:02 AM
c++
,
Fibonacci
,
non recursive
Subscribe to:
Posts
(
Atom
)
