In-storage. Sorting IDMS alternate indices. 64-bit storage optional but
31-bit storage required.
Rick
------------------------------------------------------------------------------------
Dave Roeser wrote:
Rick,
One of my developers and friend, Dave Loveluck, has written a version
in C and C++. He has written an assembler version of a balanced
Red-Green tree (ok it is Red Black ..). He says writing an assembler
version of a balanced binary tree sort would not be difficult -
although I need to find out where all this "spare" time is coming
from...hmmm
Anyway, he wishes to know if this is an "in-storage" sort or is it to
use external media?
Regards,
Dave
Dave Roeser
Product Manager
DINO-Software Corporation
<http://www.dino-software.com>
On 3/24/2011 1:16 PM, Rick Fochtman wrote:
-----------------------------------<snip>----------------------------------
I am looking forward to hearing the results of their bubble sort.
Cold, very cold. But I wouldn't bet against it.
And yes, cruel as it is it's still funny. Thanks.
------------------------------------<unsnip>------------------------------
I'd give a case of your favorite beer for an Assember implementation
of Knuth's Balanced Binary Tree sort, as detailed in his "Sorting and
Searching" volume.
I wish he'd finish that series ("The Art of Computer Programming").
After a stellar start, it seems to have died on the vine.
Rick
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
