Python中使用插入排序算法的简单分析与代码示例

def insertion_sort(n): if len(n) == 1:  return n b = insertion_sort(n[1:]) m = len(b) for i in range(m):  if n[0] <= b[i]:   return b[:i]+[n[0]]+b[i:] return b + [n[0]]

def insertion_sort(lst): if len(lst) == 1:  return lst for i in xrange(1, len(lst)):  temp = lst[i]  j = i - 1  while j >= 0 and temp < lst[j]:   lst[j + 1] = lst[j]   j -= 1  lst[j + 1] = temp return lst