擅长:python、mysql、java
<p>您的<code>mergesort</code>函数对列表进行适当排序。可以添加return语句以方便方法链接,但函数将始终返回其原始参数:</p>
<pre class="lang-py prettyprint-override"><code>def mergesort1(c, l, r):
i, j, k = 0, 0, 0
while (i < len(l)) & (j < len(r)):
if l[i] < r[j]:
c[k] = l[i]
i += 1
else:
c[k] = r[j]
j += 1
k += 1
while i < len(l):
c[k] = l[i]
i += 1
k += 1
while j < len(r):
c[k] = r[j]
j += 1
k += 1
def mergesort(c):
if len(c) >= 2:
l = c[0 : (len(c) // 2)]
r = c[len(c) // 2 : len(c)]
mergesort(l)
mergesort(r)
mergesort1(c, l, r)
return c
</code></pre>