[英]Merge Sort Using Python
我沒有得到排序列表,而是只有一個值。
def merge1(left,right):
print("left" , left , "right" , right)
def loop(left,right,ss):
print("left" , left , "right" , right)
if not (left ==[] or right ==[]):
if left[0] <= right[0]:
ss.append(left[0])
return loop(left[1:],right, ss)
else:
ss.append(right[0])
return loop(left,right[1:], ss)
print("hello")
else:
return ss
return loop(left,right,[])
def msort(s):
if len(s)>1:
mid = len(s) // 2
return merge1(msort(s[:mid]),msort(s[mid:]))
else:
return s
print(msort([9,8,7,6,5,4,3,2,1]))
您沒有解決左右陣列之一耗盡的情況。 您將必須將其余值從非空數組復制到合並數組:
def merge1(left,right):
print("left" , left , "right" , right)
def loop(left,right,ss):
print("left" , left , "right" , right)
if left and right:
if left[0] <= right[0]:
ss.append(left[0])
return loop(left[1:],right, ss)
else:
ss.append(right[0])
return loop(left,right[1:], ss)
# either one of left or right is empty so you need to copy the remaining
# values into merged array
else:
if left:
for i in left:
ss.append(i)
if right:
for i in right:
ss.append(i)
print ss
return ss
return loop(left,right,[])
def msort(s):
if len(s)>1:
mid = len(s) / 2
return merge1(msort(s[:mid]),msort(s[mid:]))
else:
return s
print(msort([9,8,7,6,5,4,3,2,1]))
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.