Sorting with an alias (which is called O(N*logN) times) is indeed significantly slower than internal sorting, even when the alias is very simple.
The random sort way is also not a good randomizer (as has been pointed out). It's just a quick and dirty way (and not an argument against the suggestion) when the file is not very large and when randomness is not meant for any "serious" application.
