Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!genrad!panda!talcott!harvard!bu-cs!bzs From: bzs@bu-cs.UUCP (Barry Shein) Newsgroups: net.lang.c Subject: Re: Sorting ANYTHING Message-ID: <453@bu-cs.UUCP> Date: Mon, 21-Apr-86 21:31:52 EST Article-I.D.: bu-cs.453 Posted: Mon Apr 21 21:31:52 1986 Date-Received: Wed, 23-Apr-86 22:37:08 EST Organization: Boston Univ Comp. Sci. Lines: 18 >If you're going to sort a small number of things, it doesn't really >matter what you use. If you're sorting lots of stuff, use a system >sort and save the maintainer the headache of reading *your* sort. > > (Root Boy) Jim Cottrell Or, if your system doesn't have a sort (or a useable sort) go to the library and find Quicker Sort in the ACM Collected Algorithms and copy the Fortran and Publication Algol code and go re-do it in whatever language you like, won't take long and it's short enough it requires no deep understanding. I did this for a bunch of people in a Chem dept who were using the VMS1.6 SORT command and saved them something like 98% of the time for sorting matrix elements (like from 30 minutes to 30 seconds or something like that) and became an instant hero...and I stole the code! Use the terrain. -Barry Shein, Boston University