Fibonacci Sequence Php Practice_PHP Tutorial

The sequence starts with the third term, and each term is equal to the sum of the previous two terms.

F0=0, F1=1, Fn=F(n-1)+F(n-2)

Recursive version and non-recursive version.

php 
function fib($n){ 
    $array = array(); 
    $array[0] = 1; 
    $array[1] = 1; 
    for($i=2;$i<$n;$i++){ 
        $array[$i] = $array[$i-1]+$array[$i-2]; 
    } 
    print_r($array); 
} 
fib(10); 
echo "\n------------------\n"; 
function fib_recursive($n){ 
    if($n==1||$n==2){return 1;} 
    else{ 
        return fib_recursive($n-1)+fib_recursive($n-2); 
    } 
} 
echo fib_recursive(10); 
?> 

<?php
function fib($n){
 $array = array();
 $array[0] = 1;
 $array[1] = 1;
 for($i=2;$i<$n;$i++){
  $array[$i] = $array[$i-1]+$array[$i-2];
 }
 print_r($array);
}
fib(10);
echo "\n------------------\n";
function fib_recursive($n){
 if($n==1||$n==2){return 1;}
 else{
  return fib_recursive($n-1)+fib_recursive($n-2);
 }
}
echo fib_recursive(10);
?>

As a C and Java programmer, the first time I wrote non-recursive code, I forgot to add $ in front of the variables, which was tragic.

Output results

Array 
( 
    [0] => 1 
    [1] => 1 
    [2] => 2 
    [3] => 3 
    [4] => 5 
    [5] => 8 
    [6] => 13 
    [7] => 21 
    [8] => 34 
    [9] => 55 
) 
 
------------------ 
55 

Array
(
    [0] => 1
    [1] => 1
    [2] => 2
    [3] => 3
    [4] => 5
    [5] => 8
    [6] => 13
    [7] => 21
    [8] => 34
    [9] => 55
)

------------------
55

http://www.bkjia.com/PHPjc/477237.htmlwww.bkjia.comtruehttp: //www.bkjia.com/PHPjc/477237.htmlTechArticleThe sequence starts with the third term, and each term is equal to the sum of the previous two terms. F0=0, F1=1, Fn=F(n-1)+F(n-2) recursive version and non-recursive version. php function fib($n){ $array = array(); $array[0] = 1; $a...