FilesExpand file tree

 master

/

MergeSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

35 lines (29 loc) · 801 Bytes

 master

/

MergeSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

35 lines (29 loc) · 801 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

# coding: utf-8

def MergeSort(lists):

if len(lists) <= 1:

return lists

num = int(len(lists) / 2)

# 从中间，进行数据的拆分, 递归的返回数据进行迭代排序

left = MergeSort(lists[:num])

right = MergeSort(lists[num:])

print left

print "*" * 20

print right

print "_" * 20

return Merge(left, right)

def Merge(left, right):

r, l = 0, 0

result = []

while l < len(left) and r < len(right):

if left[l] < right[r]:

result.append(left[l])

l += 1

else:

result.append(right[r])

r += 1

result += right[r:]

result += left[l:]

print 'result:', result

return result

if __name__ == "__main__":

print MergeSort([1, 2, 3, 4, 5, 6, 7, 90, 21, 23, 45])