Quicksort superiority over Heap Sort

Heap Sort has a worst case complexity of O(nlogn) while 开发者_如何学JAVAQuicksort has O(n^2). But emperical evidences say quicksort is superior. Why is that?One of the major factors is that quicksort