-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmergeSort.py
More file actions
46 lines (40 loc) · 1004 Bytes
/
mergeSort.py
File metadata and controls
46 lines (40 loc) · 1004 Bytes
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
36
37
38
39
40
41
42
43
44
45
46
#coding=utf-8
"""
Written by zxcode-123
------------------------------------------------------------
Usage:归并排序
"""
from generateNearlyOrdered import generateNearlyOrderedArray
def merge(left,right):
temp = []
i = j = 0
while(i<len(left) and j<len(right)):
if(left[i]<right[j]):
temp.append(left[i])
i = i + 1
else:
temp.append(right[j])
j = j+1
if(i == len(left)):
for k in right[j:]:
temp.append(k)
else:
for k in left[i:]:
temp.append(k)
return temp
def mergeSort(alist):
n = len(alist)
mid = n//2
if(n <= 1):
return alist
left = mergeSort(alist[:mid])
right = mergeSort(alist[mid:])
return merge(left,right)
def test():
arr = generateNearlyOrderedArray(10,10)
print(arr)
alist = mergeSort(arr)
print("------------------------------------------")
print(alist)
if __name__ == '__main__':
test()