Omega(n log n) is the fastest possible for a comparison sort, by a simple decision tree argument. This is true even for the average case. Their algorithm is a

Omega(n log n) is the fastest possible for a comparison sort, by a simple decision tree argument. This is true even for the average case. Their algorithm is a comparison sort, as they make clear on page 5.