RONDOT@IPFWVM.BITNET ("Lawrence E. Rondot") (09/20/89)
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. Anybody out in NetLand have one? Larry Rondot BITNET: RONDOT@IPFWVM IBM Systems Programmer Indiana - Purdue University at Fort Wayne If life is a soap opera, then 2101 Coliseum Blvd East where is my bowl of popcorn? Fort Wayne Indiana 46805-1499 USA (219) 481 6203
dwd@ATTUNIX.ATT.COM (David Dougherty) (09/20/89)
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