Thanks C, John, Kent and Andrei.
I knew that someone had thought about this problem before :). But i couldnt
relize that the problem was this widespread and had so many names.
Thanks for pointing me in the right direction. The problem is a bit over my
head but its fun with some brain exercise :
--request for a method of sorting disk files based on size so as to
fill backup disks--
You may want to check out the karp.py routine posted at
http://aspn.activestate.com/ASPN/Mail/Message/python-Tutor/749797
Right now it is coded to split N numbers into 2 groups that have sums
as nearly identi
Quoting Kent Johnson <[EMAIL PROTECTED]>:
> This is a hard problem. It is a version of the "0-1 knapsack problem" -
> googling for that might give
> you some ideas.
> > Hi
> > Some of my harddrives are getting full and i would like to burn the files
> > to
> > some cheep DVD's. Filesizes range
This is a hard problem. It is a version of the "0-1 knapsack problem" - googling for that might give
you some ideas.
Kent
Klas Marteleur wrote:
Hi
Some of my harddrives are getting full and i would like to burn the files to
some cheep DVD's. Filesizes range from lets say 1Mb to 1Gb.
Ofcourse i
Hi
Some of my harddrives are getting full and i would like to burn the files to
some cheep DVD's. Filesizes range from lets say 1Mb to 1Gb.
Ofcourse i would like to optimize the size of each DVD to be as close to 4.7Gb
as possible (to save this cheep media :) ).
There are plenty of software th