I played around with this puzzle a bit. I made a palindrome function a bit
like Bob's, only i iterated through the string (stopping at the first mismatch)
instead of doing the whole thing at once.
The rest of the code is even more amenable to speedups. The first thing I saw
was the outer "i"
Original Message
Subject:Re: [Tutor] largest palindrome number
Date: Tue, 30 Aug 2011 23:24:09 +0530
From: surya k
To: bob gailer
Mr Gailer,
That's an amazing way of writing palindrome function. Actually, I'm
still using my old C logic's here.
Thanks for
