stable algorithm with complexity O(n)

[Ed Greshko]

Aaron Konstam wrote:
> 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.
>
>   
FWIW, a judicious google search answered all of my questions on this
sort of thing.  :-)

-- 
Goals... Plans... they're fantasies, they're part of a dream world... --
Wally Shawn Mei-Mei.Greshko at greshko.com

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 252 bytes
Desc: OpenPGP digital signature
URL: <http://listman.redhat.com/archives/fedora-list/attachments/20081214/1333ebe3/attachment-0001.sig>