|
|
|
| No such thing as a small change | |
| PerlMonks |
Re^5: Finding longest palindrome from a stringby Aristotle (Chancellor) |
| on Aug 14, 2004 at 09:48 UTC ( #382927=note: print w/ replies, xml ) | Need Help?? |
|
Go ahead, the code is there. :-) I simply took cLive ;-)'s code as a starting point myself. Makeshifts last the longest.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||