-
Notifications
You must be signed in to change notification settings - Fork 2
/
merge-sort.py
90 lines (76 loc) · 2.24 KB
/
merge-sort.py
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
"""
合并2个有序数组
方法1:通用方法
"""
def merge_two_sorted_array(arrA, arrB):
arrA_index, arrB_index = 0, 0
sorted_array = []
while arrA_index < len(arrA) and arrB_index < len(arrB):
if arrA[arrA_index] < arrB[arrB_index]:
sorted_array.append(arrA[arrA_index])
arrA_index += 1
else:
sorted_array.append(arrB[arrB_index])
arrB_index += 1
while arrA_index < len(arrA):
sorted_array.append(arrA[arrA_index])
arrA_index += 1
while arrB_index < len(arrB):
sorted_array.append(arrB[arrB_index])
arrB_index += 1
return sorted_array
arrA = [ -5, 1, 3, 8, 9]
arrB = [ 0, 3, 9, 16, 33]
print(merge_two_sorted_array(arrA, arrB))
# result
# [-5, 0, 1, 3, 3, 8, 9, 9, 16, 33]
"""
合并2个有序数组
方法1:python切片
"""
def merge_two_sorted_array_slice(arrA, arrB):
arrA_index, arrB_index = 0, 0
sorted_array = []
while arrA_index < len(arrA) and arrB_index < len(arrB):
if arrA[arrA_index] < arrB[arrB_index]:
sorted_array.append(arrA[arrA_index])
arrA_index += 1
else:
sorted_array.append(arrB[arrB_index])
arrB_index += 1
sorted_array += arrA[arrA_index:]
sorted_array += arrB[arrB_index:]
return sorted_array
arrA = [ -5, 1, 3, 8, 9]
arrB = [ 0, 3, 9, 16, 33]
print(merge_two_sorted_array_slice(arrA, arrB))
# result
# [-5, 0, 1, 3, 3, 8, 9, 9, 16, 33]
"""
合并排序,递归思想
"""
def merge_sort(arr):
n = len(arr)
if n <= 1:
return arr
mid = n // 2
arrA = merge_sort(arr[:mid])
arrB = merge_sort(arr[mid:])
# 直到这里都是分割
# 接下来才是比较合并
arrA_index, arrB_index = 0, 0
sorted_array = []
while arrA_index < len(arrA) and arrB_index < len(arrB):
if arrA[arrA_index] < arrB[arrB_index]:
sorted_array.append(arrA[arrA_index])
arrA_index += 1
else:
sorted_array.append(arrB[arrB_index])
arrB_index += 1
sorted_array += arrA[arrA_index:]
sorted_array += arrB[arrB_index:]
return sorted_array
arr = [ 12, 34, 54, 2, 3, -1, 0, -16]
print(merge_sort(arr))
# result
# [-16, -1, 0, 2, 3, 12, 34, 54]