斐波那契数列

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

exit;