Hi,
I saw Roger HUI's solution[1] to Palindromic Pangram puzzle[2] and very
interested in the algorithm used behind. I'm a foreigner to J and
couldn't manage to evaluate steps described in the code snippets:
vy (~) [502:0]$ j64-602/bin/jconsole
read=: 1!:1
# t=: read <'/home/vy/temp/WORDS.LST'
|file name error: read
| #t=: read<'/home/vy/temp/WORDS.LST'
I don't want to behave disrespectful, but what I really wonder is the
algorithm/logic of the solution, instead of J itself. Excuse me if this
the wrong list to ask this questions, but would somebody mind
translating codes in the boxes located in solution page[1] to pseudo
codes?
Regards.
[1] http://www.jsoftware.com/jwiki/Puzzles/Palindromic_Pangram
[2] http://www.itasoftware.com/careers/puzzles07.html
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
