pytho學習旅途

`# merge sort 歸併排序 def merge_sort(lst): # 長度小於一則返回自身 if len(lst) <= 1 : return lst middle = int(len(lst)/2) left = merge_sort(lst[:middle]) right = merge_sort(lst[middle:]) merged = [] while left and

>>阅读原文<<