What is O(n log n)? Time complexity? What about memory requirement? Last month I decreased memory requirement from 16GB to 100MB in one implementation of a "stable&fast" algorithm.
Really, using a function just because it's O(n log n) without understanding its characteristic is like a blind surgeon randomly amputating limbs because maybe it will help.
But that's fine for me, I have more work then, fixing software bugs made by incompetent* programmers is quite nice.
*incompetent - those who think they know something and are not willing to learn anything new
*incompetent - those who think they know something and are not willing to learn anything new