For example, if there were an excessive amount of sorting such that the sort heap spilled to disk, performance would suffer.

Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.