UniqueHash is less predictable. A non-uniform hash function can produce partitions much larger than average, resulting in the need for recursive partitioning.
The ordering produced by sorting is often useful later in the query execution plan, either for algorithms requiring sorted data, or due to an ORDER BY clause.