Assertion: algorithm's time | /r/HasProperty | same running
Facets:
Source sentences:
text: For example, the Linux kernel uses a sorting algorithm called heapsort, which has the same running time as mergesort which we explored here, namely Θ( n log( n ) ) and so is optimal.