title: (C) which heap policies are most often used?
body: <p>I have heard that 'better-fit' is pretty commonly used, but I don't seem to read much about it online. What are the most commonly used / thought to be the most efficient policies used by heap allocators.</p>
  
  <p>(I admit my vocabulary may be flawed; when I say 'policy' i mean things such as 'best fit,' 'first fit,' 'next fit,' etc)</p>
  
  <p><strong>Edit:</strong> I am also particularly interested in how the heap policies of 'better fit' and doug lea's strategy (<a href="http://gee.cs.oswego.edu/dl/html/malloc.html" rel="nofollow noreferrer">http://gee.cs.oswego.edu/dl/html/malloc.html</a>) compare. Doug uses a type of best fit, but his approach uses index bins, whereas better fit uses a Cartesian tree.</p>