手寫歸併排序 python3

本地測試： def mergesort(a,b): c = [] len1 = len(a) len2 = len(b) j,i = 0, 0 while i < len1 and j < len2: if a[i] > b[j]: c.append(b[j]) j += 1 e

>>阅读原文<<