python sort list of lists with tie-breaker
<p>What is the most pythonic way to sort a list of lists with a tie-breaker?</p>

<p>I can sort by sub-list length (longest to shortest):</p>

<pre><code>&gt;&gt;&gt; l = [['c'], ['a', 'b'], ['b', 'c'], ['a', 'b', 'c']]

&gt;&gt;&gt; list(reversed(sorted(l, key=len)))
[['a', 'b', 'c'], ['b', 'c'], ['a', 'b'], ['c']]
</code></pre>

<p>But I want to preserve order when the lengths are equal, so the output I want is:</p>

<pre><code>[['a', 'b', 'c'], ['a', 'b'], ['b', 'c'], ['c']]
</code></pre>