Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!gatech!udel!ee.udel.edu
From: new@ee.udel.edu (Darren New)
Newsgroups: comp.sys.next
Subject: Re: NeXTStep interface to McGill's Archie?
Message-ID: <46802@nigel.ee.udel.edu>
Date: 7 Mar 91 06:34:08 GMT
References: <1991Mar7.011758.17135@math.ucla.edu>
Sender: usenet@ee.udel.edu
Distribution: na
Organization: University of Delaware
Lines: 15
Nntp-Posting-Host: estelle.ee.udel.edu

In article <1991Mar7.011758.17135@math.ucla.edu> barry@pico.math.ucla.edu (Barry Merriman) writes:
>Its great! (It needs to be on a faster machine though---a
>search seems to take about 10 minutes to go through the whole database.)

I'm always amused when I see a comment like this.  It's much more likely
that the program needs a real search algorithm than it is that it needs
a faster machine. (Incidently, the help messages agree.)  Why do so many
software people (and hardware people, for that matter) think that faster
hardware is the best way to speed up software?       -- Darren

-- 
--- Darren New --- Grad Student --- CIS --- Univ. of Delaware ---
----- Network Protocols, Graphics, Programming Languages, 
      Formal Description Techniques (esp. Estelle), Coffee, Amigas -----
              =+=+=+ Let GROPE be an N-tuple where ... +=+=+=