Re^4: tracking where I am in a tree structure

Recursive solutions always are harder to wrap your head around, they tend require more "faith" than iterative solutions, and that is not something most programmers are usually accustomed too (all relgious meanings aside of course).

Piffle. Recursion is neither magical nor obscure, especially when dealing with recursive data structures (like parse trees).

-- F o x t r o t U n i f o r m Found a typo in this node? /msg me % man 3 strfry

Comment on Re^4: tracking where I am in a tree structure

Replies are listed 'Best First'.
Re^5: tracking where I am in a tree structure by stvn (Monsignor) on Jul 23, 2004 at 03:50 UTC
Piffle. Recursion is neither magical nor obscure, especially when dealing with recursive data structures (like parse trees). I never said it was magical or obscure. Only that for a programmer trained to think iteratively (as most are), the concept of recursion can sometimes take some getting used to. Clearly to you it is nothing magical, as you understand it quite well (as evidenced by many of your recent posts, and particulary your ones on Haskell). But to some, it is a concept that does not sit as easily. -stvn	[reply]

Replies are listed 'Best First'.

Re^5: tracking where I am in a tree structure
by stvn (Monsignor) on Jul 23, 2004 at 03:50 UTC

Piffle. Recursion is neither magical nor obscure, especially when dealing with recursive data structures (like parse trees).

I never said it was magical or obscure. Only that for a programmer trained to think iteratively (as most are), the concept of recursion can sometimes take some getting used to.

Clearly to you it is nothing magical, as you understand it quite well (as evidenced by many of your recent posts, and particulary your ones on Haskell). But to some, it is a concept that does not sit as easily.

-stvn

[reply]