i got the Fibonacci Numbers algorithm :
#include <iostream>
using namespace std;
int fib (int n)
{
if (n<3)
return (1);
else
return (fib(n-2)+fib(n-1));
}
int main()
{
cout<<"Fibbonac iu Numbers: 1, 1, 2, 3, 5, 8, 13, 21,...\n"<<endl ;
int n, Result;
cout<<"n = "; cin>>n;
Result=fib(n);
cout<<"\n\tfib ( "<<n<<" ) = "<<Result;
cin.get(); cin.get();
return 0;
}
I need to measure the app.compute time about number 1 , 5 , 10 , 20 , 30 , 40 and 50
#include <iostream>
using namespace std;
int fib (int n)
{
if (n<3)
return (1);
else
return (fib(n-2)+fib(n-1));
}
int main()
{
cout<<"Fibbonac iu Numbers: 1, 1, 2, 3, 5, 8, 13, 21,...\n"<<endl ;
int n, Result;
cout<<"n = "; cin>>n;
Result=fib(n);
cout<<"\n\tfib ( "<<n<<" ) = "<<Result;
cin.get(); cin.get();
return 0;
}
I need to measure the app.compute time about number 1 , 5 , 10 , 20 , 30 , 40 and 50
Comment