C语言斐波那契数列程序

斐波那契数列通过相加两个前一项来生成后续项。斐波那契数列始于两个数字 − F₀ 和 F₁。F₀ 和 F₁ 的初始值分别可以取为 0、1 或 1、1。

斐波那契数列满足下列条件 −

Fn = Fn-1 + Fn-2

因此，斐波那契数列可能如下所示 −

F₈ = 0 1 1 2 3 5 8 13

或 −

F₈ = 1 1 2 3 5 8 13 21

算法

此程序的算法非常简单 −

START
   Step 1 → Take integer variable A, B, C
   Step 2 → Set A = 0, B = 0
   Step 3 → DISPLAY A, B
   Step 4 → C = A + B
   Step 5 → DISPLAY C
   Step 6 → Set A = B, B = C
   Step 7 → REPEAT from 4 - 6, for n times
STOP

伪代码

procedure fibonacci : fib_num
   
   IF fib_num less than 1
      DISPLAY 0
      
   IF fib_num equals to 1
      DISPLAY 1
      
   IF fib_num equals to 2
      DISPLAY 1, 1
      
   IF fib_num greater than 2
      Pre = 1,
      Post = 1,
      
      DISPLAY Pre, Post
      FOR 0 to fib_num-2
         Fib = Pre + Post
         DISPLAY Fib
         Pre = Post
         Post = Fib
      END FOR
   END IF

end procedure

实现

此算法的实现如下 −

#include <stdio.h>

int main() {
   int a, b, c, i, n;

   n = 4;

   a = b = 1;
   
   printf("%d %d ",a,b);

   for(i = 1; i <= n-2; i++) {
      c = a + b;
      printf("%d ", c);
      
      a = b;
      b = c;
   }
   
   return 0;
}

输出

程序输出应如下所示 −

1 1 2 3