sorting with expensive compares?
bonono at gmail.com
bonono at gmail.com
Fri Dec 23 03:09:24 EST 2005
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) ]
More information about the Python-list
mailing list