Re: Efficient enumeration of pandigital fractions

in reply to Efficient enumeration of pandigital fractions

> Any thoughts?

Do you need more? :)

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}

Comment on Re: Efficient enumeration of pandigital fractions

Replies are listed 'Best First'.
Re^2: Efficient enumeration of pandigital fractions by kikuchiyo (Hermit) on Jul 22, 2018 at 20:30 UTC
No, I'm satisfied for the time being :) (I see that I've nerd sniped (xkcd://356) you quite effectively with this problem, so my work is done here :)	[reply]
Re^3: Efficient enumeration of pandigital fractions by LanX (Saint) on Jul 22, 2018 at 21:01 UTC
> I see that I've nerd sniped you quite effectively he, he ... you earned 3 points. And actually I'm clever enough to resist implementing an algorithm which solves base-20 in way under 1 sec ...* Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice} *) definitely .. I won't ... I swear ... never ...	[reply]
Re^4: Efficient enumeration of pandigital fractions by kikuchiyo (Hermit) on Jul 22, 2018 at 21:58 UTC
FYI a straightforward reimplementation of your program in C does base 20 in 1.06 s (for comparison, the Perl version (perversion) finishes in 23 s on my machine).	[reply]
Re^5: Efficient enumeration of pandigital fractions by LanX (Saint) on Jul 22, 2018 at 22:18 UTC

In Section Seekers of Perl Wisdom