Fibonacci Series

• December 21, 2019 at 1:06 pm

• Quote

codeorayo

Keymaster

Seri Fibonacci adalah seri di mana akan mendapatkan term berikutnya dengan menambahkan dua angka sebelumnya.

Contoh:

Code:

0 1 1 2 3 5 8 13 21 34
Here, 0 + 1 = 1
1 + 1 = 2
3 + 2 = 5

Logika:

[list=*]

[/list]

Contoh:

contoh untuk mencetak 12 angka pertama dari seri Fibonacci.

Fibonacci series for first 12 numbers:

“;
echo “n”;
echo $n1.’ ‘.$n2.’ ‘;
while ($num < 10 ) { $n3 = $n2 + $n1; echo $n3.' '; $n1 = $n2; $n2 = $n3; $num = $num + 1; ?>

Output:

[img]https://static.javatpoint.com/phppages/images/fibonacci-series1.png[/img]

Seri Fibonacci menggunakan fungsi Rekursif

Rekursi adalah fenomena di mana fungsi rekursi memanggil dirinya sendiri sampai kondisi dasar tercapai.

Fibonacci series using recursive function:

“;
echo “n”;
/* Recursive function for fibonacci series. */
function series($num){
if($num == 0){
return 0;
}else if( $num == 1){
return 1;
} else {
return (series($num-1) + series($num-2));
}
}
/* Call Function. */
for ($i = 0; $i < $num; $i++){ echo series($i); echo "n"; }

Output:

[img]https://static.javatpoint.com/phppages/images/fibonacci-series2.png[/img]

Author: Javatpoint, Translated by Codeorayo