Hi!

I have heard that it has been proved that the fastest general purpose sorting algorithm, cannot have an average time complexity better than $\displaystyle \mathcal{O}(n\ log(n))$ using normal hardware. Even though I haven't heard of an algorithm that has a better time complexity before, I can't see why it shouldn't be possible, and I can't think of any way to prove this sentence. Have you heard of it before and do you know how it has been proved or how to prove it?