Article View: comp.lang.modula2
Article #244Re: Sorts
From: Chuck Lins
Date: Mon, 11 Sep 1989 20:10
Date: Mon, 11 Sep 1989 20:10
15 lines
949 bytes
949 bytes
I have a highly optimize d quicksort implementation that will appear in "The Modula-2 Software Component Library" Volume 4. As long as you are sorting arrays, it is independent of the data being sorted (since the caller provides the routines necessary for comparison and swapping of items). Link me if your're interested. Chuck Lins -- Chuck Lins | "Exit right to funway." Internet: lins@apple.com | AppleLink: LINS Snail Mail: 20525 Mariani Ave. M/S: 41-K Cupertino, CA 95014 "I like the future - I'm in it." - Firesign Theater
Technical Details
Message-ID:
<34645@apple.Apple.COM>Path:
arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!ames!sun-barr!apple!linsReferences:
<INFO-M2%89091000074411@UCF1VM>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!ames!sun-barr!apple!lins From: lins@Apple.COM (Chuck Lins) Newsgroups: comp.lang.modula2 Subject: Re: Sorts Keywords: Sorting, Modula-2 Message-ID: <34645@apple.Apple.COM> Date: 11 Sep 89 20:10:27 GMT References: <INFO-M2%89091000074411@UCF1VM> Organization: Apple Computer Inc, Cupertino, CA Lines: 15