Not to mention that Haskell's sort function is actually quite a bit more complex than the stereotypical "quicksort" example shown.
It's still short and sweet ;).
I would be impressed if a sort which used the same 3 combined techniques could be faster.
(Of course, there might be better sorts, such as TimSort, but that's a change of algorithm, not language).