stable algorithm with complexity O(n)

[Aaron Konstam]

On Sun, 2008-12-14 at 12:10 +1100, Cameron Simpson wrote:
> 
> | There is the generation counter algorithm. It is O(n), and relies on
> the fact 
> | that one knows the boundaries of the possible elements of the
> dataset (and 
> | it's domain). Basically, you simply count the number of appearances
> of every 
> | element in your set. It's just a single for-loop.
I am not on the Centos list either not do I understand the sorting
algorithm you describe above. Could you expand on the explanation above.
--
=======================================================================
Original thought is like original sin: both happened before you were
born to people you could not have possibly met. -- Fran Lebowitz,
"Social Studies"
=======================================================================
Aaron Konstam telephone: (210) 656-0355 e-mail: akonstam at sbcglobal.net