Write recurssive fibonacci and print the value in order (eg 0 1 1 2 3 5)
Code:#include <iostream> using namespace std; // Recursive Method....... int fibo_gen(int,int,int); void main() { int initial_value=0,final_value=1,count=50; fibo_gen(initial_value,final_value,count); } int fibo_gen(int initial_value,int final_value,int count) { int temp; if (count>0) { cout<<initial_value<<" "; temp=initial_value+final_value; initial_value=final_value; final_value=temp; count=count-1; fibo_gen(initial_value, final_value, count); } else return(0); }
There are currently 1 users browsing this thread. (0 members and 1 guests)
Bookmarks