Tugas Alpro PPT Minggu ke 5 Kasus 5.6
Fungsi
yang Menghitung suku ke - n dari deret Fibonanci dengan rekursif
Logikanya Menggunakan Raptor
Program C++
#include <iostream>
#include <math.h>
using namespace std;
int fibonacci (int n)
{if((n==1)||(n==2))return(1);
else return(fibonacci(n-1)+fibonacci(n-2));
}
main() {
int i,n;
cout<<"Sampai Suku Ke :";cin>>n;
for(i=1;i<=n;i++)cout<<fibonacci(i)<<",";
return 0;
}
ABOUT THE AUTHOR
A web designer from India. And then you write some more information about yourself like this to fill out the space that is left.
0 komentar:
Posting Komentar