C/C++实现斐波那契数列

一、递归实现

#include<stdio.h>int Fibonacci(int n);void main(){int num;printf("输入所需斐波那契数列的项数：");scanf_s("%d", &num);for (int i = 1; i <= num; i++){printf("%d ",Fibonacci(i));}}int Fibonacci(int n){if (n == 1 || n == 2){return 1;}if (n > 2){return Fibonacci(n - 1) + Fibonacci(n - 2);}}

二、数组实现

#include<stdio.h>int Fibonacci(int n);int main(){int num;printf("输入斐波那契数列的项数：");scanf_s("%d", &num);Fibonacci(num);}int Fibonacci(int n){int result[3] = {1,1,0};for (int i = 0; i < n;i++){if (i==0||i==1){printf("%d ",result[i]); }else{result[2]=result[0]+result[1];printf("%d ",result[2]);result[0]=result[1];result[1]=result[2];}}return 0;}

======================================================================================================

数组实现斐波那契数列比递归效率高，占用内存少。