Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site spuxll.UUCP Path: utzoo!watmath!clyde!burl!mgnetp!ihnp4!houxm!houxz!vax135!floyd!whuxle!spuxll!ech From: ech@spuxll.UUCP (Ned Horvath) Newsgroups: net.lang Subject: Re: Fastest parallel Sort Message-ID: <503@spuxll.UUCP> Date: Mon, 18-Jun-84 16:21:16 EDT Article-I.D.: spuxll.503 Posted: Mon Jun 18 16:21:16 1984 Date-Received: Fri, 22-Jun-84 09:14:01 EDT References: <26400014@uiucdcs.UUCP> Organization: AT&T Information Systems, South Plainfield NJ Lines: 6 The fastest known parallel sort uses the Batcher net and operates in time O((log n)^2). That is also known to be optimal for a general (i.e. not data-dependent) sorting algorithm. As usual, see Knuth, v. 3, for details. =Ned=