fork(3) download
  1. #include "math.h"
  2. #include <iostream>
  3. #include <iomanip>
  4.  
  5. using namespace std;
  6.  
  7. int call_count = 0;
  8.  
  9. int fibo(int n)
  10. {
  11. call_count+=1;
  12. if(n<=2)
  13. {
  14. return 1;
  15. }
  16. else {
  17. //call_count += 1;
  18. return fibo(n-1) + fibo(n-2);
  19. }
  20. return n;
  21. }
  22.  
  23. int main()
  24. {
  25. int num = 15;
  26. int total_calls = 0;
  27. cout<<"\nenter the number of integers to be printed in the fibonacci series\n";
  28. cout<<"\nfibonacci series for first "<<num<<" numbers is\n";
  29. cout<<"\n\nSerial Number\t"<<"FIBO_NUMBER\t"<<" NO_OF_CALLS MADE\n\n";
  30. for(int i=1;i<=num;i++)
  31. {
  32. call_count = 0;
  33. cout<<endl<<i<<"th number\t "<<fibo(i)<<"\t\t";
  34. cout<<call_count-1<<" calls\n";
  35. total_calls += call_count - 1;
  36. }
  37. cout<<endl<<"\n the total number of recursive calls made were "<<total_calls<<endl<<endl;
  38. return 0;
  39. }
Success #stdin #stdout 0s 3460KB
stdin
Standard input is empty
stdout
enter the number of integers to be printed in the fibonacci series

fibonacci series for first 15 numbers is


Serial Number	FIBO_NUMBER	 NO_OF_CALLS MADE


1th number	   1		0 calls

2th number	   1		0 calls

3th number	   2		2 calls

4th number	   3		4 calls

5th number	   5		8 calls

6th number	   8		14 calls

7th number	   13		24 calls

8th number	   21		40 calls

9th number	   34		66 calls

10th number	   55		108 calls

11th number	   89		176 calls

12th number	   144		286 calls

13th number	   233		464 calls

14th number	   377		752 calls

15th number	   610		1218 calls


 the total number of recursive calls made were 3162