Path: utzoo!utgpu!news-server.csri.toronto.edu!helios.physics.utoronto.ca!ists!yunexus!oz
From: oz@yunexus.yorku.ca (Ozan Yigit)
Newsgroups: comp.lang.misc
Subject: Intro to Alg. [Re: Lying]
Keywords: linear
Message-ID: <17659@yunexus.YorkU.CA>
Date: 16 Nov 90 19:42:27 GMT
References: <6097@lanl.gov> <4298@goanna.cs.rmit.oz.au>
Sender: news@yunexus.YorkU.CA
Organization: York U. Communications Research & Development
Lines: 32

In article <4298@goanna.cs.rmit.oz.au> ok@goanna.cs.rmit.oz.au
(Richard A. O'Keefe) writes:

>There is a new book
>	Introduction to Algorithms
>	Thomas H. Cormen, Charles E. Leiserson, & Ronald L. Rivest
>	MIT Press, 1990
>	ISBN 0-262-03141-8	(MIT Press, world-wide)
>	ISBN 0-07-013143-0	(McGraw-Hill, USA)
>I like it a lot. ...

Yes, I think it is a very nice book also. Kinda big, heavy and expensive
but well worth it. 

The title of Chapter 9 is "Sorting in Linear Time".
Last paragraph of the intro reads:

	Sections 9.2, 9.3 and 9.4 examine three sorting algorithms --
	counting sort, radix sort, and bucket sort -- that run in linear
	time. Needless to say, these algorithms use operations other than
	comparisons to determine the sorted order.  Consequently, the O(n
	log n) lower bound does not apply to them.

I think Dan does seem to know what he is talking about, regardless of his
overall level of (ahem) obnoxiousness. :-)

oz
---
The king: If there's no meaning             internet:  oz@nexus.yorku.ca
in it, that saves a world of trouble        usenet: ....!utai!yunexus!oz
you know, as we needn't try to find any.    bitnet: oz@[yulibra|yuyetti]
Lewis Carroll (Alice in Wonderland)         Phonet: +1 416 7365257x33976