forked from Sklyvan/RainbowSorting
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSorting_Algorithms.py
More file actions
167 lines (155 loc) · 5.8 KB
/
Sorting_Algorithms.py
File metadata and controls
167 lines (155 loc) · 5.8 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
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
import pygame
import os, sys
from pygame.locals import *
from GUI_Functions import KEY_PRESSED
from Exceptions import ArraySizeError
def InsertionSort(MyArray, Win, Font, DrawSort=True):
for arrayPosition in range(1, len(MyArray.Array)):
actualElement = MyArray.Array[arrayPosition] # Elemento que se compara.
while arrayPosition > 0 and MyArray.Array[arrayPosition - 1] > actualElement:
MyArray.Array[arrayPosition] = MyArray.Array[arrayPosition - 1]
arrayPosition -= 1
MyArray.Array[arrayPosition] = actualElement
if DrawSort:
MyArray.Moving_Elements = [MyArray.Array[arrayPosition]]
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
return MyArray
def CocktailShakerSort(MyArray, Win, Font):
for i in range(len(MyArray.Array) - 1, 0, -1):
Swapped = False
for j in range(i, 0, -1):
if MyArray.Array[j] < MyArray.Array[j - 1]:
MyArray.Array[j], MyArray.Array[j - 1] = MyArray.Array[j - 1], MyArray.Array[j]
MyArray.Moving_Elements = [MyArray.Array[j], MyArray.Array[j - 1]]
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font, extraAcceses=2) # Since we are moving two elements on the array, we have to add 2 acceses instead of one.
Swapped = True
for j in range(i):
if MyArray.Array[j] > MyArray.Array[j + 1]:
MyArray.Array[j], MyArray.Array[j + 1] = MyArray.Array[j + 1], MyArray.Array[j]
MyArray.Moving_Elements = [MyArray.Array[j], MyArray.Array[j + 1]]
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font, extraAcceses=2) # Since we are moving two elements on the array, we have to add 2 acceses instead of one.
Swapped = True
if not Swapped:
MyArray.isSorted = True
return MyArray
def BubbleSort(MyArray, Win, Font):
Swapped = True
while Swapped:
Swapped = False
for i in range(len(MyArray.Array) - 1):
if MyArray.Array[i] > MyArray.Array[i + 1]:
MyArray.Array[i], MyArray.Array[i + 1] = MyArray.Array[i + 1], MyArray.Array[i]
MyArray.Moving_Elements = [MyArray.Array[i], MyArray.Array[i + 1]]
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font, extraAcceses=2) # Since we are moving two elements on the array, we have to add 2 acceses instead of one.
Swapped = True
MyArray.isSorted = True
return MyArray
RUN = 32
def Tim_InsertionSort(MyArray, Left, Right, Win, Font):
for i in range(Left + 1, Right + 1):
Temp = MyArray.Array[i]
j = i - 1
while MyArray.Array[j] > Temp and j >= Left:
MyArray.Array[j + 1] = MyArray.Array[j]
j -= 1
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
MyArray.Array[j + 1] = Temp
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
def Merge(MyArray, l, m, r, Win, Font):
LEN_1, LEN_2 = m - l + 1, r - m
Left, Right = [], []
for i in range(0, LEN_1):
Left.append(MyArray.Array[l + i])
for i in range(0, LEN_2):
Right.append(MyArray.Array[m + 1 + i])
i, j, k = 0, 0, l
while i < LEN_1 and j < LEN_2:
if Left[i] <= Right[j]:
MyArray.Array[k] = Left[i]
i += 1
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
else:
MyArray.Array[k] = Right[j]
j += 1
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
k += 1
while i < LEN_1:
MyArray.Array[k] = Left[i]
k += 1
i += 1
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
while j < LEN_2:
MyArray.Array[k] = Right[j]
k += 1
j += 1
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
def TimSort(MyArray, Win, Font):
if not MyArray.isSorted:
N = len(MyArray.Array)
for i in range(0, N, RUN):
Tim_InsertionSort(MyArray, i, min((i + 31), (N - 1)), Win, Font)
Size = RUN
while Size < N:
for Left in range(0, N, 2 * Size):
Mid = Left + Size - 1
Right = min((Left + 2 * Size - 1), (N - 1))
KEY = KEY_PRESSED()
if KEY == "QUIT":
pygame.quit()
sys.exit()
else:
MyArray.Draw(Win, Font)
Merge(MyArray, Left, Mid, Right, Win, Font)
Size = 2 * Size
MyArray.isSorted = True
return MyArray