Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site rtp47.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!unc!mcnc!rti-sel!rtp47!throopw
From: throopw@rtp47.UUCP (Wayne Throop)
Newsgroups: net.math
Subject: Constant time sort?
Message-ID: <77@rtp47.UUCP>
Date: Mon, 24-Jun-85 13:11:16 EDT
Article-I.D.: rtp47.77
Posted: Mon Jun 24 13:11:16 1985
Date-Received: Wed, 26-Jun-85 04:42:40 EDT
Organization: Data General, RTP, NC
Lines: 6

A recent posting refered to a "constant time sort using n processors".
Given comparison sorting, even using n processors to sort n items, it
seems that it would require O(logN) time, not constant time.  Am I
right, or am I forgetting something?
-- 
Wayne Throop at Data General, RTP, NC
!mcnc!rti-sel!rtp47!throopw