On Fri, May 15, 2009 at 2:16 PM, gary ng <[email protected]> wrote: > Which sort of what I experienced in other languages as well in that > recursion is usually pretty down the list of choices unless there is no > other choices. > > Though this thread was about recursion in J(and whether TCO is important > which is IMO not as important as it sounds because of other constraints) and > not about how to avoid recursion as there usually are better solutions.
Well... you had said "I am curious to know how can one implement algorithms that needs recursion in J." I have been attempting to illustrate that, for the most point, algorithms do not need recursion in J. Or, as you have put it "recursion is usually pretty down the list of choices unless there is no other choices." (Except, I also feel there are always other choices.) Put differently: numbers themselves have recursive characteristics and definitions [for example] so, in many cases, you can use arithmetic to implement algorithms which "need recursion". This might feel like "cheating" if what you really wanted was something that "looks recursive", but recursion is a far broader topic than mere recursive invocation, and I feel that some deep insights can be obtained if you do not divorce the mechanism from the mathematics. Do my responses make sense now? Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
