Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!hao!oddjob!gargoyle!ihnp4!ttrdc!levy
From: levy@ttrdc.UUCP (Daniel R. Levy)
Newsgroups: comp.lang.c
Subject: Re: sorting (qsort)
Message-ID: <1998@ttrdc.UUCP>
Date: Tue, 24-Nov-87 13:39:38 EST
Article-I.D.: ttrdc.1998
Posted: Tue Nov 24 13:39:38 1987
Date-Received: Sat, 28-Nov-87 18:29:34 EST
References: <10491@brl-adm.ARPA> <265@cresswell.quintus.UUCP>
Organization: AT&T, Skokie, IL
Lines: 12
Summary: ok, anyone care to post a merge-sort implementation of qsort()?

In article <265@cresswell.quintus.UUCP>, ok@quintus.UUCP (Richard A. O'Keefe) writes:
>[ merge sort is better than quick sort; try it and see ]

OK, has anyone out there replaced their UNIX library's qsort() with a merge
sort implementation and found that it speeded up things that use it
considerably?  For that matter, would anyone care to post an example of
this implementation for us to test (and chew on, and flame at :-) ?
-- 
|------------Dan Levy------------|  Path: ..!{akgua,homxb,ihnp4,ltuxa,mvuxa,
|         an Engihacker @        |  	<most AT&T machines>}!ttrdc!ttrda!levy
| AT&T Computer Systems Division |  Disclaimer?  Huh?  What disclaimer???
|--------Skokie, Illinois--------|