Bifalgorithm post · Computer science one · Recursion

How can you implement the naive recursive Fibonacci sequence in PHP?

How can you implement the naive recursive Fibonacci sequence in PHP? (Computer science one · Recursion) — "As a final example, consider the following PHP imple…

Ideas in this flowchart

Implementación PHP recursiva ingenua de la secuencia de Fibonacci
La función fibonacci recibe el parámetro n
Se comprueba si n es un valor negativo inválido
Si n < 0, se lanza una excepción porque la secuencia no está definida
Se comprueba si n es menor o igual que 1
Para n <= 1, la función devuelve 1
Para valores mayores que 1, se aplica el caso recursivo
El caso recursivo suma fibonacci(n-1) y fibonacci(n-2)

Bifalgorithm

Feed/

How can you implement the naive recursive Fibonacci sequence in PHP?

No cover

Channel

Computer science one

1 page

sam23

Ebook2w

"As a final example, consider the following PHP implementation of the naive recursive Fibonacci sequence. An additional condition has been included to check for “invalid” negative values of n for which we throw an exception.\n\n1 function fibonacci($n) {\n\n2 if($n < 0) {\n\n3 throw new Exception(\"Undefined for n<0.\");\n\n4 } else if($n <= 1) {\n\n5 return 1;\n\n6 } else {\n\n7 return fibonacci($n-1) + fibonacci($n-2);\n\n8 }\n\n9 }"

Flowchart preview

👍

0 comments0 shares