Article View: comp.lang.modula2
Article #239RE: Sorts
From: "MARK GOODERUM - UNIV. OF KANSAS...
Date: Sun, 10 Sep 1989 05:27
Date: Sun, 10 Sep 1989 05:27
15 lines
1054 bytes
1054 bytes
Hmm, sorting can be very implementaion dependant. Are you sorting numbers, strings, etc. Are they a linked list, an array, etc. Are your sorting keys unique or not, etc. You get the idea. However, give me one or more details and I might dig out a procedure or algorithm around. I have a couple of Quicksort routines lying around that aren't too bad and will give you much better performance than the old quick and dirty bubble sorts. (Of course if your sorting LARGE amounts of data I have a nice Heapsort routine I did last semester.) Adios, Mark Gooderum MARKV@UKANVAX markv@kuhub.cc.ukans.edu
Technical Details
Message-ID:
<INFO-M2%89091001300983@UCF1VM>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!swrinde!ucsd!ucbvax!UKANVAX.BITNET!MARKVShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!swrinde!ucsd!ucbvax!UKANVAX.BITNET!MARKV
From: MARKV@UKANVAX.BITNET ("MARK GOODERUM - UNIV. OF KANSAS ACS - MARKV@UKANVAX")
Newsgroups: comp.lang.modula2
Subject: RE: Sorts
Message-ID: <INFO-M2%89091001300983@UCF1VM>
Date: 10 Sep 89 05:27:00 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Modula2 List <INFO-M2%UCF1VM.bitnet@jade.berkeley.edu>
Organization: The Internet
Lines: 15