Julian wrote:
>On Tue, Mar 26, 2002 at 05:53:55PM +0100, Thomas Jentzsch
wrote:
>> What Knuth doesn't write about, are the special cases we are
>> talking about:
>> - small Ns (<20) and
>> - nearly sorted values
>> - little extra memory needed
>> - small code size
>
>Actually, he does, which is what sets him apart from most
>other computer science authors. Which is why he uses assembly
>language to demonstrate the algorithms and talks about the
>words of storage and the cycles taken.
Yes, you're right. I was only refering to the first quote that
Andrew selected:
> "Compared to straight insertion (Algorithm 5.2.1S), bubble
> sorting requires a more complicated program and takes more
> than twice as long!" (pp.109)
Sorry, I should have written: "doesn't write about *here*".
Later Andrew is also quoting the formulas, and there are all
the necessary detailed informations.
Have fun!
Thomas
----------------------------------------------------------------------------------------------
Archives (includes files) at http://www.biglist.com/lists/stella/archives/
Unsub & more at http://www.biglist.com/lists/stella/
