Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.7.0.10 $; site ccvaxa
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!inuxc!pur-ee!uiucdcs!ccvaxa!preece
From: preece@ccvaxa.UUCP
Newsgroups: net.lang
Subject: Re: Efficiency of Languages (and co
Message-ID: <800005@ccvaxa>
Date: Thu, 7-Nov-85 11:57:00 EST
Article-I.D.: ccvaxa.800005
Posted: Thu Nov  7 11:57:00 1985
Date-Received: Sun, 10-Nov-85 08:12:57 EST
References: <314@watmum.UUCP>
Lines: 13
Nf-ID: #R:watmum.UUCP:314:ccvaxa:800005:000:413
Nf-From: ccvaxa.UUCP!preece    Nov  7 10:57:00 1985


> Noone knows (and indeed I think it is impossible) to sort in O(1) time
> with n log n processors.  /* Written 10:17 am  Nov  3, 1985 by
> gvcormack@watmum.UUCP in ccvaxa:net.lang */
----------
Needless to say, you can sort in O(1) time on 1 processor if you have
unbounded memory, though generating the lookup table would take
a long time... :-)

-- 
scott preece
gould/csd - urbana
ihnp4!uiucdcs!ccvaxa!preece