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.
In reply to Re^2: Perl sorting unique values
by BrowserUk
in thread Perl sorting unique values
by pr09
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |