![]() |
|
Welcome to the Monastery | |
PerlMonks |
comment on |
( #3333=superdoc: print w/replies, xml ) | Need Help?? |
The sort-then-uniq strategy will handle data of any quantity and will do so with linear performance. When will you get it through your thick skull that sorting is not linear; it is O(N log N). And disk sorting slower still. Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
In reply to Re^2: Perl sorting unique values
by BrowserUk
|
|