是否有可能计算出比O(n log n)更好的中位数?

I know that it is possible to calculate the mean of a list of numbers in O(n). But what about the median? Is there any better algorithm than sort (O(n log n)) and lookup middle element (or mean of two middle elements if an even number of items in list)?I know that it is possible to calculate the mea