Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!spool.mu.edu!munnari.oz.au!uniwa!fennel.cc.uwa.oz.au!udp_tech
From: udp_tech@fennel.cc.uwa.oz.au
Newsgroups: comp.sys.ibm.pc.misc
Subject: Re: Sorting algorithm
Message-ID: <1991Mar12.091453.3059@fennel.cc.uwa.oz.au>
Date: 12 Mar 91 01:14:53 GMT
Organization: University of Western Australia
Lines: 27

Dale Chun (Playmac Tec{nologies) wanted source code (Pascal) for
a sorting algorithm...

1. I'm a "C" person myself, but I think I'm correct in saying
that both MicroSoft & Borland include quick-sort algorithms in
their language libraries for Pascal.  That may be the answer ?

2. Leendert AMMERAAL's book "Programs and Data Structures for C"
has a nice section on sorting algorithms.  Since the syntax for
Pascal is rather similar to that for C, you may be able to cross-
compile (by hand) from the C to the Pascal.  Ammeraal is very
fond of pointers, but I think Pascal is good at those, too.

3. If you just want a fast sorter, and maybe a few nice stats
functions as well, you might like to consider |stat, a series
of modules by Dr Gary PERLMAN, Dept Computer & Info. Science,
Bolz Hall, Ohio State University, Columbus, Ohio. For everything
including sources (sorry, they're in C), you'll be battling to
spend more than $40.  I have his source code (because I want to
build a MicroSoft WINDOWS application with it), but it would
take quite a while to work your way through it -- his code is
very tight.

Hope this helps,
Denis BROWN,
Snr Electronics Tech, Uni. of Western Australia,
Dept Psychiatry & Behavioural Science.