Article View: comp.lang.misc
Article #2089Re: A very brief history of optimal sorting methods
From: Tony Warnock
Date: Thu, 15 Nov 1990 21:31
Date: Thu, 15 Nov 1990 21:31
20 lines
1313 bytes
1313 bytes
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
Technical Details
Message-ID:
<6067@lanl.gov>Path:
arc1-ca.pugleaf.net!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!ttwReferences:
<4440:Nov1405:06:2590@kramden.acf.nyu.edu> <5948@lanl.gov> <5293:Nov1518:36:0490@kramden.acf.nyu.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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