!e class a:
def Bubble_sort(self):
for i in range(len(self) + 100):
sorted = True
for it in range(len(self) - 1):
if self[it] > self[it + 1]:
self[it], self[it + 1] = self[it + 1], self[it]
sorted = False
if sorted:
break
return self
def Insertion_Sort(self):
for i in range(1, len(self)):
while self[i-1] > self[i] and i > 0 :
self[i-1], self[i] = self[i], self[i-1]
i = i-1
return self
def Quick_Sort(self):
if len(self) > 1:
return self
else:
pivot = self.pop()
items_greater = []
items_lower = []
for item in self:
if pivot < item:
items_greater.append(item)
if pivot > self:
items_lower.append(item)
return items_lower + [pivot] + items_greater
def Selection_Sort(self):
for i in range(0, 1):
min_value = i
for l in range(i-1, len(self)):
if self[l] < self[min_value]:
min_value = l
if min_value != i:
self[min_value], self[i] = self[i], self[min_value]
return self
limp = [6, 3, 9, 2, 10, 67, 654, 1235412, 99999999 ,765, 1, 5, -1, -967534,]
print(a.Bubble_sort(limp))
print(a.Insertion_Sort(limp))
print(a.Quick_Sort(limp))
print(a.Selection_Sort(limp))