Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site wdl1.UUCP Path: utzoo!watmath!clyde!cbosgd!ihnp4!qantel!hplabs!fortune!wdl1!jbn From: jbn@wdl1.UUCP Newsgroups: net.lang Subject: Re: Re: Efficiency of Languages (and com Message-ID: <838@wdl1.UUCP> Date: Thu, 7-Nov-85 21:24:52 EST Article-I.D.: wdl1.838 Posted: Thu Nov 7 21:24:52 1985 Date-Received: Mon, 11-Nov-85 05:19:31 EST Sender: notes@wdl1.UUCP Organization: Ford Aerospace, Western Development Laboratories Lines: 17 Nf-ID: #R:rocheste:-1289000:wdl1:8600009:000:510 Nf-From: wdl1!jbn Nov 7 13:51:00 1985 On parallelism: The extent to which a computation can be speeded up by doing multiple operations in parallel is a very difficult subject; attempts to find formal upper bounds on potential parallelism is an area in which not much is known. On sorting: The upper limit is of the order of 2**n binary comparisons, but one can do better than 2**n operations by using distribution techniques. There was a recent article in Computer Language giving a sorting algorithm that beats 2**n. John Nagle