Laman

Jumat, 29 Maret 2013

Fungsi Fibonacci Rekursif

//fibbonaci by x_san G.231.09.0048
#include <stdio.h>
void fibonacci(long int a, long int b, int loop);

void main()
{
int first, second, loop;
printf("masukkan suku pertama : ");
scanf("%i", &first);
printf("masukkan suku kedua : ");
scanf("%i", &second);
printf("berapa deret yang akan di cetak : ");
scanf("%i", &loop);
printf("%i ,%i",first, second);
fibonacci(first, second, loop);
}

void fibonacci(long int a, long int b, int loop)
{
if(loop==0) return;
long int next;
int next_loop;
next_loop=loop-1;
next=a+b;
printf(" ,%ld", next);
fibonacci(b, next, next_loop);
}

Tidak ada komentar:

Posting Komentar