You can skip this if only interested in the math part. Intro: I've got sets of data in excel, which need to print together, but I could print more than 1 set on a page. So, I'm thinking that I can print X number of lines, say 75, on a page. And I've got groups of data (say 20 groups) that have any number of lines, but I think they can be treated as modulo X for simplification.
The Math part: How can you find the minimum number of subsets which have a maximum sum less than X? The original set is small, so recursion isn't out of the question, but I was hoping to find something more elegant. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
