Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site hou3c.UUCP
Path: utzoo!linus!decvax!harpo!eagle!mhuxl!houxm!hocda!hou3c!ka
From: ka@hou3c.UUCP (Kenneth Almquist)
Newsgroups: net.unix
Subject: Re: Why is dir search quadratic?
Message-ID: <176@hou3c.UUCP>
Date: Tue, 10-Jan-84 00:36:05 EST
Article-I.D.: hou3c.176
Posted: Tue Jan 10 00:36:05 1984
Date-Received: Wed, 11-Jan-84 03:27:23 EST
References: <158@heurikon.UUCP>
Organization: Bell Labs, Holmdel, NJ
Lines: 6

The time to search a directory for a single file is roughly proportional
to the size of the directory.  What is quadratic is the time to access
all the files in a directory; if you double the number of files then there
are twice as many files to access and the access time for each file is
doubled, so the time to access all the files is quadrupled.
				Kenneth Almquist