You can find other people's solutions by Googling "Palindromic Pangram".
----- Original Message ----- From: Volkan YAZICI <[EMAIL PROTECTED]> Date: Sunday, April 27, 2008 23:00 Subject: [Jprogramming] Re: Palindromic Pangram To: Programming forum <[email protected]> > On Sun, 27 Apr 2008, Oleg Kobchenko <[EMAIL PROTECTED]> writes: > > I wonder if you attempted to brute-force building the tree (in > C, I > > suppose). And are there any known limits it hits: memory or time? > > I tried that in Common Lisp, and it takes hours to complete even > for a > single word you started with. I don't think that duration is related > with performance of Common Lisp, it just shows that brute force > is not a > feasible solution. Otherwise, there won't be a puzzle; everyone can > implement a solution via brute force. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
