Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watdaisy.UUCP
Path: utzoo!watmath!watnot!watdaisy!gjerawlins
From: gjerawlins@watdaisy.UUCP (Gregory J.E. Rawlins)
Newsgroups: net.math
Subject: Re: Sorting a sorted list by a different order of keys
Message-ID: <7298@watdaisy.UUCP>
Date: Tue, 11-Jun-85 11:07:18 EDT
Article-I.D.: watdaisy.7298
Posted: Tue Jun 11 11:07:18 1985
Date-Received: Wed, 12-Jun-85 01:44:35 EDT
Reply-To: gjerawlins@watdaisy.UUCP (Gregory J.E. Rawlins)
Organization: U of Waterloo, Ontario
Lines: 9

In article <11259@brl-tgr.ARPA> gwyn@brl-tgr.ARPA (Doug Gwyn <gwyn>) writes:
>[.....]
>Actually, there are some sorting methods that are better than N log N;
>[.....]

	Pardon me? Loose lips sink ships, please define your model.
-- 
Gregory J.E. Rawlins, Department of Computer Science, U. Waterloo
{allegra|clyde|linus|inhp4|decvax}!watmath!watdaisy!gjerawlins