Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^2: Euclidean algorithm Golf in Perl 6

by John M. Dlugosz (Monsignor)
on Jun 19, 2009 at 14:30 UTC ( #773049=note: print w/replies, xml ) Need Help??

in reply to Re: Euclidean algorithm Golf in Perl 6
in thread Euclidean algorithm Golf in Perl 6

The last one is very interesting. Wouldn't the original arguments need to be sorted first, though? I think it only works if $a >= $b. Looking back at the original, it is the same way. The wikipedia article requires this for the modulo version (as well as the recursive version), but not for the subtraction version.

Your last one vividly illustrates how the algorithm generates successive refinements.

I also suppose that the "Golf" module, which would create 1-char Unicode aliases for a bunch of things, should include a symbol to mean "recursive call". Besides being shorter than naming the function again, you may want to do it with unnamed blocks, and &?ROUTINE is also rather verbose. ↺ perhaps?

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://773049]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (10)
As of 2018-06-19 15:15 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (114 votes). Check out past polls.