This is Haskell. Anything can be short if you're so smart. Just throw in some unreadable squiggles. :P

But it's short. And short means smart. We appreciate smart.

Sorting the list in O(n log n) to check if it is sorted, which can be done in O(n), is not a Best Practice.

( People, please stop upvoting such solutions. )