Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site alice.UUCP Path: utzoo!watmath!clyde!burl!ulysses!allegra!alice!ark From: ark@alice.UucP (Andrew Koenig) Newsgroups: net.lang Subject: Time complexity of sort Message-ID: <4516@alice.UUCP> Date: Sun, 3-Nov-85 14:28:24 EST Article-I.D.: alice.4516 Posted: Sun Nov 3 14:28:24 1985 Date-Received: Mon, 4-Nov-85 03:08:31 EST Organization: Bell Labs, Murray Hill Lines: 3 If I remember right, even though the time complexity of sort is O(log n) on a single processor, the median of a set can be found in O(n). It is hard to imagine how this might be done, but...