O(n^2) better than O(n*log(n))

Is there any situation a sorting algorithm of time complexity O(n^2) could be better than an O(n*log(n)) sorting algorithm in anyway?