php实现斐波那契数列代码分享

<?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); 
?> 

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