It seems to me that you could use a loop, and not have recursion at all.
Henry Rich On 1/26/2019 10:13 AM, Brian Schott wrote:
Pascal, Thank you. I added a counter and when it failed the counter was 1998. N is over 500,000. x is the large growing noun. I also assigned x to a global name then and at failure #x was 2656. It will take me a little while to translate my real verbs into bar1 and bar2. Are you optimistic about Power working here? On Sat, Jan 26, 2019 at 8:40 AM 'Pascal Jasmin' via Programming < programm...@jsoftware.com> wrote:How many times do you guess the function is recursing the power version (with X0 Y0 initial values for x and y) 10 (bar1 ; bar2 )&>/^:([ > 0 #@{:: ] )^:_ X0 ; Y0---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
--- This email has been checked for viruses by AVG. https://www.avg.com ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
