-----------------------------------<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
