C语言查找斐波那契数列和程序

本节演示如何使用while循环编写C程序来查找斐波那契数列的和。在此示例中，while循环迭代从0到n的数字以打印斐波那契数并查找这些值的总和。

#include<stdio.h>
 
int main()
{
   int Number, First = 0, Second = 1, Next = 0, sum = 0;
 
   printf("Enter Maximum Number for Fibonacci Series = ");
   scanf("%d", &Number);
 
   printf("First %d Fibonacci Series Numbers:\n", Number);
 
   while( First <= Number)
   {
      printf("%d ", First);
      sum = sum + First;
      Next = First + Second;
      First = Second;
      Second = Next; 
   }
   printf("\nThe Sum of Fibonacci Series Numbers = %d\n", sum);
}

使用for循环查找斐波那契数列和的C程序

在此程序中，用于查找斐波那契数列的和，我们已将while循环替换为For循环。

#include <stdio.h>
int main()
{
	int Number, Next, Second = 1, sum = 0;

	printf("\n Please Enter the Range Number: ");
	scanf("%d",&Number);
	
	for(int First = 0; First <= Number;) 
	{
		printf("%d ", First);
      	        sum = sum + First;
      	        Next = First + Second;
		First = Second;
      	        Second = Next; 
	}
	printf("\nThe Sum = %d\n", sum);
}

 Please Enter the Range Number: 25
0 1 1 2 3 5 8 13 21 
The Sum = 54

在此示例中，fibonacciSeries递归函数通过递归调用来计算斐波那契数列的和。

#include<stdio.h>

int fibonacciSeries(int Number)
{
   if ( Number == 0 )
      return 0;
   else if ( Number == 1 )
      return 1;
   else
      return ( fibonacciSeries(Number - 1) + fibonacciSeries(Number - 2) );
} 
 
int main()
{
   int Number, i = 0, j, sum = 0;
 
   printf("\nEnter Maximum Number = ");
   scanf("%d", &Number);
 
   printf("Fibonacci Series Numbers up to %d:\n", Number);
 
   for ( j = 0 ; j < Number; j++ )
   {
      printf("%d   ", fibonacciSeries(j));
      sum = sum + fibonacciSeries(j);
   }
     printf("\nThe Sum = %d\n", sum);
}

Enter Maximum Number = 20
Fibonacci Series Numbers up to 20:
0   1   1   2   3   5   8   13   21   34   55   89   144   233   377   610   987   1597   2584   4181   
The Sum = 10945