Here's a quicksort routine that I (iirc) adapted slightly from one
posted here by Tony Gravagno...
SUBROUTINE SR.QSORT(MAT KEYS, MAT EXTRAS, START.AT, END.AT,
ASCENDING)
*
*
*
* Arguments:
*
* KEYS(n)(I/O) Array
Thanks to the folks who posted their routines, however
the one I was looking for used the Quicksort algorithm
(with the use of at least one pivot).
I did some searching and found an interesting one
written in Java which speeds up the Quicksort when the
number elements to sort in the array is do
UNT
ATTR = ATTR.LIST
SORT.REC = DATA.BASE
NEXT ATTR.I
ORD = SORT.REC
WRITE ORD ON ORDER.BACK, 'SORTED'
STOP
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] Behalf Of Jacques G.
Sent: Saturday, February 19, 2005 10:33
To: u2-users@listserver.u2ug.org
Subjec
Someone posted a Quicksort routine a while back where
dependent elements could also be sorted with the array
that was being sorted. Could someone repost it please
(or supply a link to where I can find it ?)
Thanks
__
Do you Yahoo!?
Read only t
