Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Memoryless iterator for integer partitions

by Limbic~Region (Chancellor)
on Jun 19, 2007 at 13:24 UTC ( #622013=note: print w/replies, xml ) Need Help??


in reply to Memoryless iterator for integer partitions

blokhead,
I used the code I wrote in Re: Generator of integer partitionts of n for RFC: Integer::Partition::Unrestricted. Algorithm analysis is not my cup of tea but I would appreciate it if you could tell me how it fares with memory utilization compared to your solution. As a side note, you might find Re: Permutation of groups comical.

Cheers - L~R

  • Comment on Re: Memoryless iterator for integer partitions

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://622013]
help
Chatterbox?
[Discipulus]: there is also find2perl with your perl installation
[Discipulus]: and in the wanted sub you just calculate the duretion and add it the total, stop
[shmem]: sub wanted { push @files, $File::Find::name if $File::Find::name =~/\.mp3$/ }
[Lady_Aleena]: shmem, that is understandable! The two examples in File::Find don't make sense to me on a quick glance.
[marioroy]: LA if the find worked from Unix command line, or does it not. Likely a quoting issue inside Perl qx.
[Lady_Aleena]: marioroy, the find worked fine at the command line.

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (12)
As of 2017-04-23 20:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (432 votes). Check out past polls.