Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!yale!think.com!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!aplcen!haven!adm!cmcl2!lanl!ttw
From: ttw@lanl.gov (Tony Warnock)
Newsgroups: comp.lang.misc
Subject: Re: A very brief history of optimal sorting methods
Message-ID: <6067@lanl.gov>
Date: 15 Nov 90 21:31:52 GMT
References: <4440:Nov1405:06:2590@kramden.acf.nyu.edu> <5948@lanl.gov> <5293:Nov1518:36:0490@kramden.acf.nyu.edu>
Organization: Los Alamos Natl Lab, Los Alamos, N.M.
Lines: 20



Dan Bernstein has posted the following advice:
"Please don't say anything if you don't know what you're talking about."
 
He has incorrectly stated the complexity of sorting.
Perhaps he could follow his own advice:
"Please don't say anything if you don't know what you're talking about."
 
He has stated that "a few bits" are all that are necessary to represent
value that grows combinatorily.
Perhaps he could follow his own advice:
"Please don't say anything if you don't know what you're talking about."
 
He has incorrectly stated that Fortran does not have separate compilation.
Perhaps he could follow his own advice:
"Please don't say anything if you don't know what you're talking about."
 

The road of excess leads to the palace of wisdom.  - William Blake