Some Java/C# design flaws

[Justin Johansson]

Nick Sabalausky wrote:
> "retard" <re at tard.com.invalid> wrote in message 
> news:hk9use$f4r$1 at digitalmars.com...
>> Tue, 02 Feb 2010 08:16:38 +1030, Justin Johansson wrote:
>>
>>> Funny about this; virtually every CS101 course covers recursive binary
>>> tree node visitation but rarely is there a mention of the iterative
>>> solution.  The iterative solution is much more tricky but for larger N,
>>> is almost a must for practical situations.
>> Well they only taught us the iterative solution and mentioned that the
>> recursive version is kind of nice to know for theoretical reasons, but
>> you never should use recursion in practice because it's so slow. I guess
>> this is great because it makes learning functional programming much
>> harder.
> 
> I'm reminded of the second half ("Inorder Walks of BSP Trees", pg 1107-1113) 
> of chapter 59 in Michael Abrash's "Graphics Programming Black Book"), and 
> the story of his iterative-tree-walking interview test.
> 
> ( http://nondot.org/~sabre/Mirrored/GraphicsProgrammingBlackBook/ ) 

Ah, so it was you who dated Wendy Tucker when you were 14 :-)