Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!batcomputer!cornell!uw-beaver!milton!ogicse!pdxgate!qiclab!percy!m2xenix!puddle!p25.f506.n106.z1.fidonet.org!Jon.Guthrie
From: Jon.Guthrie@p25.f506.n106.z1.fidonet.org (Jon Guthrie)
Newsgroups: comp.lang.modula2
Subject: Re: Procedure Variables and Records and Sorting
Message-ID: <786.27FC2FF0@puddle.fidonet.org>
Date: 3 Apr 91 01:25:37 GMT
Article-I.D.: puddle.786.27FC2FF0
Sender: ufgate@puddle.fidonet.org (newsout1.26)
Organization: FidoNet node 1:106/506.25 - Fulcrum's Edge, Spring TX
Lines: 24


 On a message of 28-Mar-91, George Emery (1:105/6.0) Said:

 > Actually, I do prefer to use linked lists (some form of psychological
 > limitation as a result of previous encounters with FORTH and LISP),
 > particularly if I'm sorting large records.

Well, I tell you what.  I've got the StonyBrook compiler on order and
when it arrives, I'll recode the linked-list sort in Modula-2.  It
won't go out before this weekend (which is okay considering I'm so
busy at work I won't have a chance to get to it before then) but I'll
try and remember to post it.

One thing though:  I had completely forgotten about getting the
generic pointer (of type ADDRESS, that is) to an array and passing
THAT to the sorting routine.  If you do that, then you can write a
general sorting routine for arrays in Modula.  (I simply had never
thought of that before.)



--  
uucp: uunet!m2xenix!puddle!106!506.25!Jon.Guthrie
Internet: Jon.Guthrie@p25.f506.n106.z1.fidonet.org