Article View: comp.lang.modula2
Article #3420Re: Merge sort
From: Peter Moylan
Date: Tue, 26 Mar 1996 03:57
Date: Tue, 26 Mar 1996 03:57
13 lines
1015 bytes
1015 bytes
Colin Gesy (Colin_Gesy@mindlink.bc.ca) wrote:
>Hi, does anybody have a merge sort algorithm they can send
>me , or know where I might find one. An immediate response would
>be appreciated....thanks
Look in practically any book on data structures. They might
not have the code, but they'll all have the algorithm.
--
Peter Moylan peter@ee.newcastle.edu.au
http://www.eng.newcastle.edu.au/ee/Moylan.html
OS/2 freeware list at
http://www.eng.newcastle.edu.au/ee/Moylan/os2/os2info.html
Technical Details
Message-ID:
<4j7q04$icr@seagoon.newcastle.edu.au>Path:
arc1-ca.pugleaf.net!fourier.newcastle.edu.au!peterReferences:
<84436-827655151@mindlink.bc.ca>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!fourier.newcastle.edu.au!peter From: peter@fourier.newcastle.edu.au (Peter Moylan) Newsgroups: comp.lang.modula2 Subject: Re: Merge sort Date: 26 Mar 1996 03:57:56 GMT Organization: The University of Newcastle Distribution: world Message-ID: <4j7q04$icr@seagoon.newcastle.edu.au> References: <84436-827655151@mindlink.bc.ca> Reply-To: peter@tesla.newcastle.edu.au NNTP-Posting-Host: fourier.newcastle.edu.au X-Newsreader: TIN [version 1.2 PL2]