Fibonacci recursion
Hi
how about following code for fibonacci... it uses recursion, does not do redundant calculations and is simple .... :)
#include <iostream>
using namespace std;
int flag=2,f;
void fibo(int a,int b)
{
if (flag>=f)
return;
else
{
flag++;
cout << ","...