首页 > 编程语言 > 详细

mergesort_arithmetic_python

时间:2018-03-22 13:12:50      阅读:185      评论:0      收藏:0      [点我收藏+]
 1 def merge(a, b):
 2     c = []
 3     h = j = 0
 4     while j < len(a) and h < len(b):
 5         if a[j] < b[h]:
 6             c.append(a[j])
 7             j += 1
 8         else:
 9             c.append(b[h])
10             h += 1
11 
12     if j == len(a):
13         for i in b[h:]:
14             c.append(i)
15     else:
16         for i in a[j:]:
17             c.append(i)
18 
19     return c
20 
21 
22 def merge_sort(lists):
23     if len(lists) <= 1:
24         return lists
25     middle = int(len(lists)/2)
26     left = merge_sort(lists[:middle])
27     right = merge_sort(lists[middle:])
28     return merge(left, right)
29 
30 
31 if __name__ == __main__:
32     a = [4, 7, 8, 3, 5, 9]
33     print(merge_sort(a))

 

mergesort_arithmetic_python

原文:https://www.cnblogs.com/zysps1/p/mergesort.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!