Recall that to sort n elements with a comparison-based algorithm requires $ \Omeaga$(n log n) time.