Reply To: program for fibonacci series

[Humayan]

try:
 

/****************************************************************<br /> * File Name : c:programshelpfibonacci1.cpp<br /> * Date : September,11,2008<br /> * Comments : new project<br /> * Compiler/Assembler :<br /> * Program Shell Generated At: 3:40:46 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> #include < stdio.h ><br /> //#include < string.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br />  <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br />  void fibonacci ( int firstTerm , int secondTerm , int numberOfTerms );<br /> //##################################################################################<br /> <br />  //main function ******************************<br /> int main ( )<br /> {<br />     int numberOfTerms;<br />     printf ( "enter the number of terms: " );<br />     scanf ( "%i" , &#038; numberOfTerms );<br />     fibonacci ( 0 , 1 , numberOfTerms );<br />  printf ( "n" );<br />  return 0 ;<br /> }<br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : fibonacci<br />  Parameters :<br />   firstTerm a(n) int ,<br />   secondTerm a(n) int ,<br />   numberOfTerms a(n) int<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void fibonacci ( int firstTerm , int secondTerm , int numberOfTerms )<br /> {<br />     if ( numberOfTerms == 0 )<br />     {<br />         return;<br />     }<br />     else<br />     {<br />         if ( firstTerm == 0 )<br />   {<br />    printf ( "0 1 " );<br />    numberOfTerms -= 2;<br />   }<br />   printf ( "%i" , firstTerm + secondTerm );<br />         printf ( " " );<br />   fibonacci ( secondTerm , firstTerm + secondTerm , numberOfTerms - 1 );<br />     }<br />     return;<br /> }<br />  

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62

/****************************************************************<br /> * File Name : c:programshelpfibonacci1.cpp<br /> * Date : September,11,2008<br /> * Comments : new project<br /> * Compiler/Assembler :<br /> * Program Shell Generated At: 3:40:46 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> #include < stdio.h ><br /> //#include < string.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br />  <br /> <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br />  void fibonacci ( int firstTerm , int secondTerm , int numberOfTerms );<br /> //##################################################################################<br /> <br />  //main function ******************************<br /> int main ( )<br /> {<br />     int numberOfTerms;<br />     printf ( "enter the number of terms: " );<br />     scanf ( "%i" , &#038; numberOfTerms );<br />     fibonacci ( 0 , 1 , numberOfTerms );<br />  printf ( "n" );<br />  return 0 ;<br /> }<br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : fibonacci<br />  Parameters :<br />   firstTerm a(n) int ,<br />   secondTerm a(n) int ,<br />   numberOfTerms a(n) int<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void fibonacci ( int firstTerm , int secondTerm , int numberOfTerms )<br /> {<br />     if ( numberOfTerms == 0 )<br />     {<br />         return;<br />     }<br />     else<br />     {<br />         if ( firstTerm == 0 )<br />   {<br />    printf ( "0 1 " );<br />    numberOfTerms -= 2;<br />   }<br />   printf ( "%i" , firstTerm + secondTerm );<br />         printf ( " " );<br />   fibonacci ( secondTerm , firstTerm + secondTerm , numberOfTerms - 1 );<br />     }<br />     return;<br /> }<br />