Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

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]
[Tanktalus]: What's so happy about it? :P
[Tanktalus]: ww: your parens don't line up. Sure, perl can look like line noise, but the parens still have to line up. ;)
[Tux]: 1nickt did you build 5.24.3, 5.26.1, and 5.27.4 yet?
Tux now has 284 working versions of perl
[1nickt]: Tux oh yes, have filed reports from them already :-)
1nickt has 44 for one version of one OS ...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (6)
As of 2017-09-25 16:34 GMT
Find Nodes?
    Voting Booth?
    During the recent solar eclipse, I:

    Results (282 votes). Check out past polls.