Welcome to HVM Discussions! #23
steinerkelvin
announced in
Announcements
Replies: 1 comment
-
Can hvm in theory optimise simple recursive fibonacci such as this? A quick test, it still suffers perf penalty. (Fib 0) = (0)
(Fib 1) = (1)
(Fib n) = (+ (Fib (- n 1)) (Fib (- n 2))) |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
👋 Welcome!
We’re using Discussions as a place to connect with other members of our community. We hope that you:
build together 💪.
Beta Was this translation helpful? Give feedback.
All reactions