Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!rice!uw-beaver!zephyr.ens.tek.com!tektronix!reed!reeder
From: reeder@reed.UUCP (Doug Reeder)
Newsgroups: comp.lang.pascal
Subject: Re: Merge sort
Message-ID: <13893@reed.UUCP>
Date: 18 Jan 90 11:26:41 GMT
References: <1990Jan15.191730.5965@i-core.UUCP>
Reply-To: reeder@reed.UUCP (Doug Reeder)
Organization: Institute of Knowledge, Jinx
Lines: 14

In article <1990Jan15.191730.5965@i-core.UUCP> zig-zag@i-core.UUCP (Brian Gouge) writes:
>Would someone please post the source for a merge sort routine?  Even better

A natural merge sort appears on pp. 105-106 of "Pascal for Programmers" by
Lecarme & Nebut, McGraw-Hill 1984   ISBN 0-07-036958-5 
{capsule review: great!} I can photocopy it if you email me your address, or
better yet, mail me a stamped,self-addressed envelope.


-- 
Doug Reeder                                   USENET: ...!tektronix!reed!reeder
from ARPA: tektronix!reed!reeder@berkeley.EDU BITNET: reeder@reed.BITNET
the Little Mermaid on materialism:
"I just don't see how a world that makes such wonderful things could be bad."