CareerCup

void printFibonacci(int ith)
{
	std::cout << endl;
	int num1 = 0;
	int num2 = 1;
	std::cout << setw(4) << num1;
	std::cout << setw(4) << num2;
	for(int i = 3; i <= ith; i++)
	{
		int temp = num1 + num2;
		std::cout << setw(4) << temp;
		num1 = num2;
		num2 = temp;

	}
	std::cout << endl;
}

This is not recursive however, this is a standard loop approach

void rFibonacci(int pCount)
{
        static int i = 0;
        static int j = 1;
        int temp = 0;
        if(pCount)
        {
                printf("%d ",i);
                temp = i+j;
                i = j;
                j = temp;
                pCount--;
                rFibonacci(pCount);
        }
}

very nice, but i screwed up since i was trying to think from top to bottom , as in
fib(n-1)+fib(n-2) approach :( and there was time constraint to write program

The above program may not impress the interviewer very much..it is not advisable to use static variables in recursion as it defeatss the whole puropse

void printFib(int pCount, int i=0,int j=1)
{
if(pCount){ cout<<i; pcount--;}
if(pCount) { printFib(pCount,j,i+j); }
}

public class RecursiveFibonacci {

    static void recursiveFibonacci(int count, int i, int j) 
    {
        if(count > 0) {
            System.out.print(i + " ");
            recursiveFibonacci(count-1, j, i+j);
        }   
    }   
    
    static void recursiveFibonacci(int count) // bootstrap function 
    {
        recursiveFibonacci(count, 0, 1);
    }

    public static void main(String args[]) 
    {
        recursiveFibonacci(6);
        System.out.println();
    }
}

void printFib(int pCount, int i=0,int j=1)
{
if(pCount){ cout<<i; pcount--;}
if(pCount) { printFib(pCount,j,i+j); }
}

int fib(int n)
{
if(n=0||n=1){
return 1;
}
else{
return fib(n-2) + fib(n-1);
}

}

#include <stdio.h>
void Fib(int a, int b,int *cnt){
    printf("%d  ",a);
    (*cnt)--;
    if (*cnt <= 0) return;
    Fib(b, a+b, cnt);
}

main(int argc, _TCHAR* argv[])
{
	int count = 10;
	Fib(0,1, &count);
	return;
}

#include <stdio.h>
int fibonacci( int n);
void printFib(int m);
int main() {
	printf("Fibonacci seq \n\n\n");
	printFib(6);
	printf("\n");
	return 1;

}
//print series till m
void printFib(int m) {
	if(m>0) {
		printFib(m-1);
		printf("%d ", fibonacci(m));
	}
}
//fibonoacci no at position n
int fibonacci( int n){
	if(n>0) {
		if(n>2) {
			return fibonacci(n-1)+fibonacci(n-2);
		} else {
			return n-1;
		}
	}
}