Re: [stella] Bubble Sort

Subject: Re: [stella] Bubble Sort
From: Thomas Jentzsch <tjentzsch@xxxxxx>
Date: Tue, 26 Mar 2002 17:53:55 +0100
Andrew wrote:
>Whilst the discussion is interesting, I still think you guys 
*really* need
>to read Knuth's work on sorting.  I looked up his analysis of 
bubble sort, and quote...

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

Generally you (and he) are 100% right, Bubble Sort is even 
worse than other simple O(n^2) sorting algorithms, which are 
all complete crap for larger numbers of N and random values, 
but it is IMO the perfect choice for our special problem. 

>The above ONE
>paragraph of his 780 page volume on sorting and searching!  
And that volume
>is just one of 3 published so far.

I remember having read parts of the book during my studies. 
It's sometimes IMO a bit to theoretical, but still fundamental.

Have fun!	

Archives (includes files) at
Unsub & more at

Current Thread