-
Notifications
You must be signed in to change notification settings - Fork 0
/
bubbleSort.py
47 lines (41 loc) · 1.27 KB
/
bubbleSort.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
#Simple Bubble Sort
#15.07.17
#g7tro4w
import random
class BubbleSort:
arraySize = 0
array = []
def __init__(self, sizeOfArray, intervalFrom, intervalTo):
self.arraySize = sizeOfArray
i = 0
random.seed()
while i < self.arraySize:
self.array.insert(i, random.randint(intervalFrom, intervalTo))
i= i + 1
def __del__(self):
self.array.clear()
def printArray(self):
print(self.array)
def sort(self):
isSorted = 0
while not(isSorted):
isSorted = 1
i = 0
while(i < self.arraySize-1):
if(self.array[i+1]<self.array[i]):
self.array[i+1] = self.array[i] + self.array[i+1]
self.array[i] = self.array[i+1] - self.array[i]
self.array[i+1] = self.array[i+1] - self.array[i]
isSorted = 0
i = i + 1
def main():
while 1:
n = int(input('Enter size of array:\n'))
a = int(input('Enter primary position for random:\n'))
b = int(input('Enter final position for random:\n'))
sort = BubbleSort(n, a, b)
sort.printArray()
sort.sort()
sort.printArray()
del sort
main()