擅长:python、mysql、java
<p>这可能是个补救办法-</p>
<pre><code>def insertionSort(ar):
newNo = ar[-1]
for i in range(0, m-1):
if(newNo < ar[m-i-1]):
ar[m-i] = ar[m-i-1]
for e in ar:
print e,
print
ar[m-i-1] = newNo
for f in ar: print f,
m = input()
ar = [int(i) for i in raw_input().strip().split()]
insertionSort(ar)
</code></pre>
<p><em>编辑-好!^已经有人提过了。</em></p>