in reply to Decomposing sum to unique sets of summands

I found a couple of algorithms (expressed in Fortran, but it should be easy to convert1 them to Perl ;-)) on Netlib, specifically 403 and 448. The algortithms were published in ACM's Collected Algorithms and Transactions on Mathematical Software in the early 1970's; both CALGO and TOMS are refereed publications, so at least one person other than the author has vetted the code.


1 I'll try to do that tonight.


Information about American English usage here and here. Floating point issues? Please read this before posting. — emc

  • Comment on Re: Decomposing sum to unique sets of summands