sorting with expensive compares?

gene tani gene.tani at
Fri Dec 23 09:03:42 CET 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!

might be simpler to memoize  cmp(), look in online cookbook or
something like this decorator

More information about the Python-list mailing list