On Wed, Feb 25, 2015 at 4:13 PM, Steven D'Aprano <steve+comp.lang.python at pearwood.info> wrote: > TimSort is an algorithm, and it is not broken. The algorithm is correct. The algorithm asserted an invariant but failed to actually establish it. That sounds broken to me.