Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ncar!hsdndev!cmcl2!kramden.acf.nyu.edu!brnstnd
From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.lang.misc
Subject: Re: Will this *thread* ever halt?
Message-ID: <29769.Jun2503.35.2591@kramden.acf.nyu.edu>
Date: 25 Jun 91 03:35:25 GMT
References: <OZ.91Jun23145702@ursa.ccs.yorku.ca> <12358.Jun2400.03.5891@kramden.acf.nyu.edu> <MACRAKIS.91Jun24135614@next15.osf.org>
Organization: IR
Lines: 10

In article <MACRAKIS.91Jun24135614@next15.osf.org> macrakis@osf.org (Stavros Macrakis) writes:
> Since when is an algorithm's ``importance'' measured by the
> percentage of programmers using it?

You're right. A better definition would be an algorithm or set of
algorithms worthy of a section in volumes 1 through 3, or an algorithm
that renders some of the information in volumes 1 through 3 obsolete. If
Knuth's books are ``out of date'' then surely such algorithms exist, no?

---Dan