Complex sentence: Heapsort also competes with merge sort, which has the same time bounds, but requires Ω (n) auxiliary space, whereas heapsort requires only a constant amount.
Split into simpler sentences: Heapsort also competes with merge sort, which has the same time bounds. Merge sort requires Ω (n) auxiliary space, but heapsort requires only a constant amount.