Re:Recursive fibonacci benchmark using top languages on GitHub
by sometimesijust on Friday September 28, 2018 @06:02AM
(#18092175)
It can be a gateway for learning interesting things about the mechanics of a language, its compilation, and in turn how to make similar cases in other languages faster/cleaner/more-secure. e.g. why is nim so fast in this case? Is it tail call optimisation, not doing overflow checks, static inlining, or something else? Nim compiles to c to it is especially odd.
[ Parent
| on HN ]
There are no comments on this comment yet.