It is actually quite easy to beat gnusort for performance.
Firstly it uses miniscule buffers relative to modern memory sizes necessitating far more write read cycles than could ever be optimum.
Secondly, with most machines having multiple cores these days, it is silly not to utilise them.
In reply to Re^2: Linux sort or FILE::SORT
by BrowserUk
in thread Linux sort or FILE::SORT
by perl_lover_always
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |