Assertion: sorting algorithm | /r/HasAspect | same running time
Facets:
value: as mergesort
type: MANNER
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.