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 [email protected]
signature.asc
Description: OpenPGP digital signature
-- fedora-list mailing list [email protected] To unsubscribe: https://www.redhat.com/mailman/listinfo/fedora-list Guidelines: http://fedoraproject.org/wiki/Communicate/MailingListGuidelines
