Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!batcomputer!munnari.oz.au!brolga!uqcspe!cs.uq.oz.au!warwick
From: warwick@cs.uq.oz.au (Warwick Allison)
Newsgroups: comp.lang.modula2
Subject: Re: : Abstract data types and generics
Message-ID: <601@uqcspe.cs.uq.oz.au>
Date: 5 Apr 91 05:43:53 GMT
References: <INFO-M2%91040413181133@UCF1VM.BITNET>
Sender: news@cs.uq.oz.au
Reply-To: warwick@cs.uq.oz.au
Lines: 27

In AL281785@VMTECSLP.BITNET (RoDoGu) writes:

>PROCEDURE QSort(N: CARDINAL; Less: CompareProc; Swap: SwapProc);
>
>  PROCEDURE Sort(l,r: CARDINAL);
>	...
>  END Sort;

And????

BEGIN
	Sort(1,N)
END Qsort;

Is that right?  Perhaps Qsort needs Lower,Upper rather than N, to
facilitate sorting arrays, etc. of ranges [0..3], etc. or perhaps
INTEGERS would be better, for eg. [-32..31]... etc.

Very interesting code though.

Thanks.
Warwick.
--
  _--_|\   	warwick@cs.uq.oz.au
 /      *  <--	Computer Science Department,
 \_.--._/ 	University of Queensland,
       v    	AUSTRALIA.