Re:Dijkstra was right – recursion should not be difficult
by aidenn0 on Monday August 07, 2017 @06:24PM
(#14951767)
It is very rare that the tail-recursive form of a function is more readable than the non-tail recursive form. I find tail-recursion intellectually interesting, but of little use for actual programming.
Contrasted with tree-recursion where the code is often so pithy that its correctness is obvious (assuming you understand recursion).
Re:Dijkstra was right – recursion should not be difficult
by eru on Monday August 07, 2017 @07:08PM
(#14952048)
Tail recursion sometimes comes up naturally. It's essentially a goto with parameters. Thus it comes up where goto is also (at least borderline) useful, eg implementing state machines.
Contrasted with tree-recursion where the code is often so pithy that its correctness is obvious (assuming you understand recursion).