sorting performance less than O(nlogn) -

besides limited bucket sort, why not possible achieve sorting performance less in run time less o(nlog(n))?

in limited domains possible beat n log n limit.

for example using van emde boas priority queue , combining thorups.

conversely, priority queue can trivially used sorting: first insert keys sorted, extract them in sorted order repeatedly deleting minimum. asymptotically, settles complexity of priority queues in terms of of sorting.