| |||||||||||||
recursionrecursionPosted Aug 19, 2010 16:33 UTC (Thu) by tialaramex (subscriber, #21167)In reply to: Xorg flaw by avik Parent article: An ancient kernel hole is closed
AFAIU It is always possible to transform a recursive algorithm into an equivalent iterative one which stores intermediate state on the heap.
In some cases the recursive algorithm will be clearer, which makes maintenance easier (and reduces the chance of security relevant bugs). In some cases the iterative algorithm will be faster (particularly if your programming language or compiler suck)
(Log in to post comments)
recursion Posted Aug 22, 2010 3:31 UTC (Sun) by jeremiah (subscriber, #1221) [Link]
>AFAIU It is always possible to transform a recursive algorithm into an equivalent iterative one which stores intermediate state on the heap.<
you don't write much XSLT do you...;)
|
|||||||||||||