[Python]collection.dequeを使ってマージソートをする - Qiita

def merge_sort(a): # 空配列の場合は返す if len(a) <= 1: return a n = len(a) x = n / 2 l, r = [], [] # 分割 for i in range(n): if i < x: l.append(a[i]) else: r.append(a[i]) # 再帰関数の呼び出し l = merge_sort(l) r = merge_sort(r) # 結合 merged = [] merged.extend(l) r.reverse() merged.extend(r) b = [] while len(merged) != 0: first = merged[0] last = merged[len(merged)-1] if first <= last: b.append(first) del merged[0] el