Home  >  Article  >  Backend Development  >  Two ways to implement Fibonacci sequence in PHP

Two ways to implement Fibonacci sequence in PHP

小云云
小云云Original
2018-03-31 14:52:462510browse

This article mainly shares with you two methods of implementing Fibonacci sequence in PHP. It is mainly shared with you in the form of code. I hope it can help you.

<?php
function feibo($n){
    $a=array();
    for($i=0;$i<$n;$i++)
    {
        if($i==0 || $i==1){
            $a[$i]=1;
        }else{
            $a[$i]=$a[$i-1]+$a[$i-2];
        }
    }
    $str = implode(&#39;,&#39;, $a);
    return $str;
}
var_dump(feibo(10));
echo "</br>";


function digui($n){
	if($n==0 || $n==1){
		return 1;
	}else{
		return digui($n-1)+digui($n-2);
	}
}
function aaa($n){
	$a=array();
	for ($i=0; $i <$n ; $i++) { 
		$a[$i] = digui($i);
	}	
	$str = implode(&#39;,&#39;, $a);
    return $str;
}

Related recommendations:

php method to implement Fibonacci sequence

js to implement Fibonacci sequence

PHP implements Fibonacci sequence

The above is the detailed content of Two ways to implement Fibonacci sequence in PHP. For more information, please follow other related articles on the PHP Chinese website!

Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn