To be efficient, it is something that the sorting algorithm should support itself. Hence "sort -u" existing despite "sort | uniq" working (if you don't run out of resources). So this option would be a nice addition to sort.pm.
- tye
In reply to Re: a way to do 'sort|uniq' (efficient)
by tye
in thread a way to do 'sort|uniq'
by jch341277
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |