title: Heapsort: why not use "Soft Heap" to boost the performance?
body: <p>From the <a href="http://en.wikipedia.org/wiki/Soft_heap" rel="nofollow">Soft Heap</a> wikipedia page, it seems that the min extraction only takes constant time, thus using a soft heap to perform heapsort should lead to an amortized O(n). Even if the constant is large, for very large n this algorithm should be very useful. But I've never heard people mentioning this. Is there a reason that people do not use this?</p>
  
  <p>Thanks!</p>