Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Printing combinations, code review request

by demerphq (Chancellor)
on Apr 26, 2003 at 13:06 UTC ( [id://253352]=note: print w/replies, xml ) Need Help??


in reply to Printing combinations, code review request

I came up with the below. Basically my intention was to avoid copying the arrays unless necessary.

#!/usr/bin/perl use strict; use warnings; my @list = (1 .. 5); my $take = 2; comb_demerphq(\@list, $take, []); sub comb_demerphq { my ($items,$group,$list)=@_; return _comb_demerphq([ @{ $items||[] } ],$ group, [ @{ $list||[] +} ] ); } sub _comb_demerphq { my ($items,$group,$list) = @_; unless ($group) { print "@$list\n"; } else { my @newlist = (@$list,undef); while (@$items) { $newlist[-1]=shift (@$items); _comb_demerphq([@$items], $group - 1, \@newlist); } } }

But i suspect that there are still better ways to improve this by using a different algorithm. Not sure what it is though.


---
demerphq

<Elian> And I do take a kind of perverse pleasure in having an OO assembly language...

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://253352]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others pondering the Monastery: (4)
As of 2025-03-27 00:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    When you first encountered Perl, which feature amazed you the most?










    Results (68 votes). Check out past polls.

    Notices?
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.