GCD and Fibonacci Series
GCD
#include
#include
using namespace std;
int gcd(int a, int b);
int main()
{
int a,b;
cout<<"Greatest Common Divisornn";
cin>> a;
cin>> b;
cout<< "Greatest common divisior of "<
}
int gcd(int a, int b)
{
while (a != b)
{
if (a > b)
a -= b;
else
b -= a;
}
return a;
}
#########################################################
FibSeries
#include
#include
using namespace std;
int fib(int a);
int main()
{
int a;
cout<<"Enter an integer: ";
cin>>a;
cout<<"The fibonnaci Series of "<
}
int fib(int a)
{
int b;
if(a==1)
return 1;
else if(a==0)
return 0;
else
b = (fib(a-1)+fib(a-2));
return b;
}
January 19, 2009 + Posted in Uncategorized +
