title: Cache efficient heap for heap sort
body: <p>I am working on project where I want to sort data using heap sort because worst case is very important for my project. I  Know that quick sort is more fast on avg case but I can't use it in my project because of o(n^2) worst case.</p>
  
  <p>I want to know is there any cache efficient heap which I can use for heap sort which has less space complexity?  And I want to know  The effect of cache efficiency on heap sort and quick sort?  And how much it affect heap sort?  Is it affect is too much or negligible?    </p>