Should make the difference between comparison sorting and others

[make-github-pseudonymous-again]

Comparing bucketsort to quicksort is like comparing apples and oranges. It is also important to understand that O(n log n) for comparison sorting is asymptotically optimal (up to a constant factor), and so it should not be ``Bad''.