111013_演算法_Fibonacci數列

費氏數列:
f(0)=0
f(1)=1
f(n)=f(n-1)+f(n-2)


求第n項的費氏數列:


int fibonacci(int n){
if(n == 0)  return 0;
else if(n == 1) return 1;
else    return (fibonacci(n-1) + fibonacci(n-2));
}




求n項費氏數列的和:

#include <stdio.h>
#include <stdlib.h>
#define N 8


int fibo(int);


int main()
{
int a;
int sum = 0;
for(a=1; a<=N; a++){
sum += fibo(a);
}
  printf("%d" , sum);

system("pause");
return 0;
}


int fibo(int n){
if(n == 0)  return 0;
else if(n == 1) return 1;
else    return (fibo(n-1) + fibo(n-2));
}


*複習