See also http://www.jsoftware.com/jwiki/Essays/Memoization
----- Original Message ----- From: June Kim <[EMAIL PROTECTED]> Date: Monday, November 13, 2006 9:01 pm Subject: [Jprogramming] The Priest Mathematician > http://www.programming- > challenges.com/pg.php?page=downloadproblem&probid=110606&format=html > This one is not difficult. One can use dynamic programming. (If I were > solving this problem in other languages, I'd use memoization.) > > As Roger has masterfully shown in > http://www.jsoftware.com/jwiki/Essays/Collatz_Conjecture , J's > approach to dynamic programming is updating(amending }) an array > repetitively. > > How would you solve this problem in J, efficiently and elegantly? ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
