Subject: Re: [stella] Bubble Sort From: Julian Squires <tek@xxxxxxx> Date: Tue, 26 Mar 2002 13:32:22 -0330 |
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. -- -/ |/| Julian Squires <tek@xxxxxxx> /- ---------------------------------------------------------------------------------------------- Archives (includes files) at http://www.biglist.com/lists/stella/archives/ Unsub & more at http://www.biglist.com/lists/stella/
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [stella] Bubble Sort, Thomas Jentzsch | Thread | Re: [stella] Bubble Sort, Thomas Jentzsch |
Re: [stella] Bubble Sort, Thomas Jentzsch | Date | Re: [stella] Bubble Sort, Thomas Jentzsch |
Month |