Re:Introducing Surinx (Ruby syntax w/ Java typing)
by mbrubeck on Wednesday August 26, 2009 @02:24PM
(#787745)
Writing it tail-recursively forces you to switch from the O(2^n) algorithm (which has two recursive calls; you can't put both into tail position) to a more efficient algorithm. You could also write the more-efficient algorithm without tail recursion, of course.
[ Parent
| on HN ]
There are no comments on this comment yet.