Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!rex!uflorida!gatech!prism!ccoprrm
From: ccoprrm@prism.gatech.EDU (Robert E. Minsk)
Newsgroups: comp.lang.pascal
Subject: Re: Fitting files on disk
Message-ID: <24389@hydra.gatech.EDU>
Date: 15 Mar 91 03:46:41 GMT
References: <26272@adm.brl.mil> <2406@umriscc.isc.umr.edu>
Organization: Information Technology - High Performace Computing
Lines: 12


  This algoritm has a time complexity in O(n^2) and for "n" files of random
size will use approximately 0.3*sqrt(n) extra disk.  For a good discussion
of this and many more algorithms see,
Computer Algorithms
Introduction to Design and Analysis
by Sara Baase
-- 
Robert E. Minsk - Information Technology | After WREKage their is Ruins...   |
ARPA: ccoprrm@prism.gatech.edu           | Fridays at 10pm WREK Atlanta 91.1 |
uucp: ...!{allegra,amd,hplabs,seismo,ut-ngp}!gatech!prism!ccoprrm
Georgia Institute of Technology, Atlanta Georgia, 30332