The point was doing it using recursion not iteration. When the data structures themselves are recursive, a recursive algorithm can be a lot simpler/shorter/more elegant than iteration. That's kind of the whole point of functional programming.
On Tuesday, July 7, 2015 at 9:28:01 PM UTC+2, Steven G. Johnson wrote: > > > > On Tuesday, July 7, 2015 at 11:11:19 AM UTC-4, Steven Sagaert wrote: >> >> see http://blog.zachallaun.com/post/jumping-julia to work around not >> having TCO and still use recursion to traverse LARGE data structures >> without stackoverflow. That's also how a bunch of other languages (e.g. >> Scala & F#) do this (called "trampolining"). >> > > (You could also just use a loop.) >
