mirror of
https://github.com/TheAlgorithms/PHP.git
synced 2025-01-17 15:18:13 +01:00
24 lines
458 B
PHP
24 lines
458 B
PHP
<?php
|
|
|
|
/*
|
|
* Function to find nth number in Fibonaccu sequence.
|
|
* Uses a version of memoization and runs very fast!
|
|
*/
|
|
|
|
/**
|
|
* @param int $n position to check
|
|
* @param array $m array to store solved trees
|
|
*/
|
|
function fibonacciPosition(int $n, array &$m = [])
|
|
{
|
|
if(isset($m[$n])) return $m[$n];
|
|
if($n < 2) return $n;
|
|
|
|
$m[$n] = fibonacciPosition($n - 1, $m) + fibonacciPosition($n - 2, $m);
|
|
|
|
return $m[$n];
|
|
|
|
}
|
|
|
|
print fibonacciPosition(59);
|