python归并排序链表_python 归并排序 动画演示

到了包含递归的排序了

Python

def merge_sort(arg):

print arg

if len(arg) <=1:

return arg

num = int(len(arg)/2)

left = merge_sort(arg[:num])

right = merge_sort(arg[num:])

return merge(left,right)

def merge(left,right):

l,r = 0,0

result = []

while l < len(left) and r

if left[l] < right[r]:

result.append(left[l])

l +=1

else :

result.append(right[r])

r +=1

result +=left[l:]

result +=right[r:]

return result

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

<