Fibonacci sequence: Difference between revisions
Added Uiua solution
(Added to Yabasic recursive, analytical and sequence methods using the Binet formula) |
(Added Uiua solution) |
||
Line 14,425:
fibionacci 46=1836311903
</pre>
=={{header|Uiua}}==
{{works with|Uiua|0.10.0-dev.1}}
Simple recursive example with memoisation.
<syntaxhighlight lang="Uiua">
F ← |1 memo⟨+⊃(F-1)(F-2)|∘⟩<2.
F ⇡20
</syntaxhighlight>
=={{header|UNIX Shell}}==
| |||