>>5Time complexity matters a lot less when writing real algorithms than is typically advertised. Its often far more important to optimize for the branch predictor and cache, which means algorithms with low entropy and good locality.
O(nlogn) algorithms tend to do lots of branching, and lose far more to simpler O(n^2) algorithms.