Re:Computer History Museum 2018 Fellow: Guido van Rossum
by detaro on Thursday February 22, 2018 @08:27AM
(#16437363)
Many of these programs do not get tail-call elimination (e.g. I think most languages can not automatically optimize the equivalent of "return f(n-1) + f(n-2)", if they do tail-call elimination at all). The nicest ones do not bother with negative n, some others don't. IMHO not a very useful set of comparisons.
[ Parent
| on HN ]
There are no comments on this comment yet.