Re: Sorting in reverse is not the same as sorting then reversing

References	<5571ad0c$0$13005$c3e8da3$5496439d@news.astraweb.com> <mkscv8$6q2$1@ger.gmane.org>
Date	2015-06-05 10:28 -0500
Subject	Re: Sorting in reverse is not the same as sorting then reversing
From	Skip Montanaro <skip.montanaro@gmail.com>
Newsgroups	comp.lang.python
Message-ID	<mailman.204.1433518134.13271.python-list@python.org> (permalink)

Show all headers | View raw

On Fri, Jun 5, 2015 at 9:50 AM, Stefan Behnel <stefan_ml@behnel.de> wrote:
> [Stable sorting is] a general property of Python's sort algorithm.

And at times an extremely valuable property.

Skip

Back to comp.lang.python | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

Sorting in reverse is not the same as sorting then reversing Steven D'Aprano <steve@pearwood.info> - 2015-06-06 00:07 +1000
  Re: Sorting in reverse is not the same as sorting then reversing Stefan Behnel <stefan_ml@behnel.de> - 2015-06-05 16:50 +0200
  Re: Sorting in reverse is not the same as sorting then reversing Peter Otten <__peter__@web.de> - 2015-06-05 16:59 +0200
  Re: Sorting in reverse is not the same as sorting then reversing Skip Montanaro <skip.montanaro@gmail.com> - 2015-06-05 10:28 -0500

csiph-web