Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!smurf!flatlin!tpki!kaiki!kai From: kai@kaiki.toppoint.de (Kai Voelcker) Newsgroups: comp.binaries.ibm.pc.d Subject: Re: Disk/File Utility Needed Message-ID: Date: 13 May 91 22:10:05 GMT References: <1991May10.183052.29786@zip.eecs.umich.edu> Organization: Toppoint Mailbox e.V. Kiel, W. Germany Lines: 16 mrice@dip.eecs.umich.edu (Michael Rice) writes: ... > files in a directory then copy them to a floppy doing its best > to fill the floppy up completely. ... > to copy based on the free space on the floppy. I wrote a small program to do this. The algorithm is basing on the FFD - algortihm (First-Fit-Decreasing) for the bin packing problem. It has a worst case performance of 11/9 OPT and typically 1.03 OPT. It works for filling up floppies with files very good. If there is interest I can post it in this board. _________________________________________________________________ | Kai Voelcker, Kappelner Str. 18, D-2300 Kiel 1, +49 431 335605 | | interests: masm, c, pascal; OR Algorithms | | >>> polite notice: I have to pay for incoming mail. Thanks <<< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~