in reply to
Memoryless iterator for integer partitions
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
I have absolutely zero preference
Results (151 votes),