On Thu, May 14, 2009 at 2:38 PM, gary ng <[email protected]> wrote: > On Thu, May 14, 2009 at 11:20 AM, Raul Miller <[email protected]> wrote: >> > So if by 'serious' you mean coding in 'pure' style(i.e. no fallback to >> > loop), I am curious to know how can one implement algorithms that needs >> > recursion in J. >> >> For example: >> 1 2 3 + 4 >> 5 6 7 >> > This is an example that no recursion is needed.
This gets into concepts of "need" and concepts of "recursion". If the language implements primitive recursion in most primitives (J does), can we really say that no recursion is needed? http://en.wikipedia.org/wiki/Primitive_recursive_function Alternatively, if the algorithm itself only requires primitive recursion is full recursion really needed? -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
