擅长:python、mysql、java
<p>编写自己的<em>排序</em>版本并不难。以下是一个替换项(不包括<em>cmp</em>参数):</p>
<pre><code>def _count():
i = 0
while 1:
yield i
i += 1
def sorted(iterable, key=None, reverse=False):
'Drop-in replacement for the sorted() built-in function (excluding cmp())'
seq = list(iterable)
if reverse:
seq.reverse()
if key is not None:
seq = zip(map(key, seq), _count(), seq)
seq.sort()
if key is not None:
seq = map(lambda decorated: decorated[2], seq)
if reverse:
seq.reverse()
return seq
</code></pre>