NIM : 1710511008
Fibonacci (n){
If(n==0) ~~~~ t1
n=0; ~~~~ t2
n=1; ~~~~ t4
Else
~~~~ t5
Fibo(0)= t1 + t2 ~~~~ C1
Fibo(1)= t1 + t3 + t4 ~~~~ C2
Analisis:
Dst…
Maka
= 2 fibo (n-1) + 1
= 2 (2 fibo(n-2) + 1) = 22 fibo(n-2) +2 + 1
= 22 (2 fibo(n-3) + 1) + 2 + 1 = 23 fibo(n-3) + 22 + 2 + 1
i n
= 2≈2
3. Sumber
https://spatabang.blogspot.com/2015/08/fungsi-rekursif-untuk-mencari-deret.html
https://situsbersamablog.wordpress.com/2016/11/28/analisa-matematis-rekursif-
bilangan-fibonacci/
https://id.wikipedia.org/wiki/Bilangan_Fibonacci