forked from z2labplus/algorithm-python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbasic_sort.py
More file actions
97 lines (84 loc) · 2.13 KB
/
Copy pathbasic_sort.py
File metadata and controls
97 lines (84 loc) · 2.13 KB
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
91
92
93
94
95
96
97
"""
python3.6.4
@Date : "2018-10-15"
@Author :"HerryZhang"
#Reference :https://time.geekbang.org/column/article/41802
"""
def bubble_sort(raw_list):
"""
冒泡排序
"""
flag = False
list_len = len(raw_list)
for i in range(list_len):
for j in range(list_len - i - 1):
if raw_list[j] > raw_list[j + 1]:
tmp = raw_list[j]
raw_list[j] = raw_list[j + 1]
raw_list[j + 1] = tmp
flag = True
if not flag:
break
return raw_list
def insertion_sort(raw_list):
"""
插入排序
"""
list_len = len(raw_list)
if list_len <= 1:
return
for i in range(1, list_len):
value = raw_list[i] # 1
for j in range(i, -1, -1):
if raw_list[j - 1] > value:
raw_list[j] = raw_list[j - 1]
else:
break
raw_list[j] = value
return raw_list
def selection_sort(raw_list):
"""
选择排序
"""
list_len = len(raw_list)
end_border = list_len - 1
for i in range(end_border):
sub = i
for j in range(i + 1, list_len):
if raw_list[sub] > raw_list[j]:
sub = j
raw_list[i], raw_list[sub] = raw_list[sub], raw_list[i]
return raw_list
def merge_sort(raw_list):
if len(raw_list) <= 1:
return raw_list
mid = len(raw_list) // 2
left = merge_sort(raw_list[:mid])
right = merge_sort(raw_list[mid:])
return merge(left, right)
def merge(left, right):
pre = 0
off = 0
res = []
while pre < len(left) and off < len(right):
if left[pre] <= right[off]:
res.append(left[pre])
pre = pre + 1
else:
res.append(right[off])
off = off + 1
res += left[pre:]
res += right[off:]
return res
def quick_sort(arrs):
if len(arrs) <= 1:
return arrs
left = []
right = []
pivot = arrs.pop()
for num in arrs:
if num > pivot:
right.append(num)
else:
left.append(num)
return quick_sort(left) + [pivot] + quick_sort(right)