sorting with expensive compares?

[bonono at gmail.com]

Dan Stromberg wrote:
> Hi folks.
>
> Python appears to have a good sort method, but when sorting array elements
> that are very large, and hence have very expensive compares, is there some
> sort of already-available sort function that will merge like elements into
> a chain, so that they won't have to be recompared as many times?
> 
> Thanks!
Sounds like DSU time.

[a] -> [ (hash(a), a) ]