-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort_alg.py
150 lines (120 loc) · 3.43 KB
/
sort_alg.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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
import time
import random
### QUICKSORT ###
def partition(arr, begin, end):
pivot = begin
for i in range(begin + 1,end + 1):
if arr[i] <= arr[begin]:
pivot += 1
arr[i], arr[pivot] = arr[pivot], arr[i]
arr[begin], arr[pivot] = arr[pivot], arr[begin]
return pivot
def quicksort(arr, begin = 0, end = None):
if end is None:
end = len(arr) - 1
if begin >= end:
return
pivot = partition(arr, begin, end)
quicksort(arr, begin, pivot - 1)
quicksort(arr, pivot + 1, end)
### MERGE SORT ###
def merge(arr, begin, end, mid):
n = mid - begin + 1
m = end - mid
L = [0] * n
R = [0] * m
for i in range(0, n):
L[i] = arr[begin + i]
for j in range(0,m):
R[j] = arr[mid + j + 1]
i = 0
j = 0
for k in range(begin,end+1):
if i >= n:
arr[k] = R[j]
j += 1
elif j >= m:
arr[k] = L[i]
i += 1
else:
if L[i] <= R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
def merge_sort(arr, begin = 0, end = None):
if end is None:
end = len(arr) - 1
if begin >= end:
return
mid = begin + (end - begin)//2
merge_sort(arr, begin, mid)
merge_sort(arr, mid + 1, end)
return merge(arr, begin, end, mid)
### INSERTION SORT ###
def insertion_sort(arr):
for i in range(1,len(arr)):
j = i
while j > 0 and arr[j-1] > arr[j]:
arr[j-1], arr[j] = arr[j], arr[j-1]
j -= 1
### SELECTION SORT ###
def selection_sort(arr):
for i in range(0,len(arr)):
min_el_index = i
for j in range(i + 1, len(arr)):
if arr[j] < arr[min_el_index]:
min_el_index = j
if min_el_index != i:
arr[i], arr[min_el_index] = arr[min_el_index], arr[i]
### HEAPSORT ###
def max_child(index, size, heap):
if index * 2 + 1 > size:
return index * 2
else:
return index * 2 if heap[index * 2] > heap[index * 2 + 1] else index * 2 + 1
def shift_down(index, size, heap):
while index * 2 <= size:
mc = max_child(index, size, heap)
if heap[index] > heap[mc]:
return
heap[index], heap[mc] = heap[mc], heap[index]
index = mc
def build_heap(arr):
size = len(arr)
arr = [0] + arr
index = size // 2
while index > 0:
shift_down(index, size, arr)
index -= 1
def heapsort(arr):
build_heap(arr)
size = len(arr) - 1
for i in range(size, 1, -1):
arr[1], arr[i] = arr[i], arr[1]
size -= 1
shift_down(1,size,arr)
arr = arr[1:]
### SHELL SORT ###
def shell_sort(arr):
distances = [1750,701,301,132,57,23,19,4,1] # Marcin Ciura's sequence
size = len(arr)
for distance in distances:
for i in range(distance, size):
temp = arr[i]
j = i
while j >= distance and arr[j - distance] > temp:
arr[j] = arr[j - distance]
j -= distance
arr[j] = temp
### BUBBLE SORT ###
def bubble_sort(arr):
for i in range(0,len(arr)):
swapped = False
for j in range(0,len(arr)):
if arr[i] <= arr[j] and arr[i] is not arr[j]:
arr[i], arr[j] = arr[j], arr[i]
swapped = True
if swapped == False:
return