Re: memory sort routine

Article View: comp.lang.asm370

Article #139

#139

From: David Dougherty
Date: Wed, 20 Sep 1989 11:26

29 lines
1349 bytes

In article <8909200546.AA22953@jade.berkeley.edu> you write:
>Not wanting to re-invent the wheel, I am looking for an assembler routine
>to sort an array in memory.  Not a large one, just an array of double words,
>and only a few thousand entries.
>

Larry,

        I wrote a sorting routine when I taught a course in computer
organization, using IBM S/360-370 assembly language.  It operates on
characters, but it wouldn't be that difficult to modify it to operate
on double words.  I'll see if I can find it.

--

--
David W. Dougherty @ AT&T Bell Laboratories
ARPA: dwd@attunix.att.COM
UUCP: ...!att!attunix!dwd
TELE: 201/522-6241
MAIL: Rm. E-125; 190 River Road; Summit, NJ 07901
---

--
David W. Dougherty @ AT&T Bell Laboratories
ARPA: dwd@attunix.att.COM
UUCP: ...!att!attunix!dwd
TELE: 201/522-6241
MAIL: Rm. E-125; 190 River Road; Summit, NJ 07901

Technical Details

Message-ID: <8909201447.AA27593@jade.berkeley.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!usc!ucsd!ucbvax!psuvm.UUCP!whv

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!usc!ucsd!ucbvax!psuvm.UUCP!whv
From: whv@psuvm.UUCP (David Dougherty)
Newsgroups: comp.lang.asm370
Subject: Re: memory sort routine
Message-ID: <8909201447.AA27593@jade.berkeley.edu>
Date: 20 Sep 89 11:26:56 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: IBM 370 Assembly Programming Discussion List <ASM370%UCF1VM.bitnet@jade.berkeley.edu>
Distribution: inet
Organization: The Internet
Lines: 29