Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84 exptools; site whuxl.UUCP Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!whuxl!mike From: mike@whuxl.UUCP (BALDWIN) Newsgroups: net.lang Subject: Time complexity of sort Message-ID: <773@whuxl.UUCP> Date: Sun, 3-Nov-85 12:23:41 EST Article-I.D.: whuxl.773 Posted: Sun Nov 3 12:23:41 1985 Date-Received: Mon, 4-Nov-85 02:24:01 EST Distribution: net Organization: AT&T Bell Laboratories, Whippany Lines: 8 For n numbers on one processor is O(n log n); for a sufficiently large but finite number of processors in parallel is O(log n). The algorithm works by partitioning the numbers into sets ala divide and conquer, and then the processors do a near-sort (i.e., the numbers are "almost" sorted) and a merge until you get to the top of the tree. -- Michael Baldwin {at&t}!whuxl!mike