[Python-Dev] decorate-sort-undecorate
Greg Ewing
greg at cosc.canterbury.ac.nz
Tue Oct 14 21:43:42 EDT 2003
More information about the Python-Dev mailing list
Tue Oct 14 21:43:42 EDT 2003
- Previous message: [Python-Dev] decorate-sort-undecorate
- Next message: [Python-Dev] decorate-sort-undecorate
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Guido: > > Don't you still need a tie-breaker index to preserve stability? > > No, because the sort algorithm is already stable. In which case it makes no sense at all for stability to be an option, since you'd have to go out of your way to make it *un*stable! The only issue then is to avoid comparing the whole record, and this presumably should be non-optional as well. Greg Ewing, Computer Science Dept, +--------------------------------------+ University of Canterbury, | A citizen of NewZealandCorp, a | Christchurch, New Zealand | wholly-owned subsidiary of USA Inc. | greg at cosc.canterbury.ac.nz +--------------------------------------+
- Previous message: [Python-Dev] decorate-sort-undecorate
- Next message: [Python-Dev] decorate-sort-undecorate
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-Dev mailing list