Php trainer in the Fibonacci series

The number of columns starts from the third and each item is equal to the sum of the first two items.

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); ?> <?phpfunction 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 programmer of C and java, when writing non-recursion for the first time, I forgot to add $ before the variable.

Output result

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