Palindromic Number Challenge Closed with Fastest Entry by Philippe Guglielmetti

in Palindromic Number Delphi Challenge :: Philippe Guglielmetti from Switzerland sent the closing entry for the palindromic number Delphi challenge - he provided the fastest algorithm!

The challenge was to find the number of palindromic (1234321 is a palidromic number. Any number that is the same when written forwards or backwards is called a palindromic number) numbers from 1 to X.

Philippe used an article from Wolfram MathWorld about Palindromic Numbers Theory and converted theory to Delphi code :)
Note: the same article gave me the idea to create this challenge :))

Read the full article to explore all entries and download full code Palindromic Number Delphi Challenge Final Results

Here's Philippe's explanation of the algorithm he used (translated from French to English using Google)

Related:

• A List of Delphi Programming Exercises / Challenges
• Math in Delphi
• Arithmetic routines in RTL