python2022/sorting.py at main · ksprski/python2022 · GitHub

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
import sys, random, copy, time

if len(sys.argv) == 3:
        n = int(sys.argv[1])
        if sys.argv[2] == "True":
                out = True
        else:
                out = False

elif len(sys.argv) == 2:
        n = int(sys.argv[1])
        out = False
else:
        n = 10
        out = False

numbers = [random.randint(0,1000) for _ in range(n)]


def python_sort(lst, out):
        print('\npython sort')
        arr = copy.deepcopy(lst)
        t0 = time.time()
        arr.sort()
        print(time.time() - t0)
        if out:
                print(arr)


def bubble_sort(lst, out):
        print('\nbuble sort')
        arr = copy.deepcopy(lst)
        t0 = time.time()

        flag = True
        i = 1
        while flag:
                flag = False
                for j in range(n - i):
                        if arr[j] > arr[j + 1]:
                                arr[j], arr[j + 1] = arr[j + 1], arr[j]
                                flag = True
                i += 1

        print(time.time() - t0)
        if out:
                print(arr)

def insertion_sort(lst, out):
        print('\ninsertion sort')
        arr = copy.deepcopy(lst)
        t0 = time.time()

        for i in range(1, n):
                key = arr[i]
                j = i - 1
                while j >= 0 and arr[j] > key:
                        arr[j + 1] = arr[j]
                        j -= 1
                arr[j + 1] = key

        print(time.time() - t0)
        if out:
                print(arr)

def selection_sort(lst, out):
        print('\nselection sort')
        arr = copy.deepcopy(lst)
        t0 = time.time()

        for i in range(n - 1):
                minindex = i
                for j in range(i + 1, n):
                        if arr[j] < arr[minindex]:
                                minindex = j
                if minindex != i:
                        arr[i], arr[minindex] = arr[minindex], arr[i]

        print(time.time() - t0)
        if out:
                print(arr)


def quick_sort(lst, out):
        def quicksort(nums, fst, lst):
                if fst >= lst:
                        return None

                i, j = fst, lst
                p = nums[(fst + lst)//2]

                while i <= j:
                        while nums[i] < p:
                                i += 1
                        while nums[j] > p:
                                j -= 1
                        if i <= j:
                                nums[i], nums[j] = nums[j], nums[i]
                                i, j = i + 1, j - 1
                quicksort(nums, fst, j)
                quicksort(nums, i, lst)


        print('\nquick sort')
        arr = copy.deepcopy(lst)
        t0 = time.time()
        quicksort(arr, 0, n - 1)
        print(time.time() - t0)
        if out:
                print(arr)


def merge_sort(lst, out):
        def mergesort(arr, left, right):
                def merge(arr, left, right, mid):
                        i = 0
                        j = 0
                        lst1 = arr[left:mid+1]
                        lst2 = arr[mid+1:right+1]
                        while i < len(lst1) and j < len(lst2):
                                if lst1[i] < lst2[j]:
                                        arr[left] = lst1[i]
                                        i += 1
                                else:
                                        arr[left] = lst2[j]
                                        j += 1
                                left += 1
                        for x in lst1[i:]:
                                arr[left] = x
                                left += 1
                        for y in lst2[j:]:
                                arr[left] = y
                                left += 1
                        return arr

                if (left < right):
                        mid = left + (right - left) // 2
                        mergesort(arr, left, mid)
                        mergesort(arr, mid + 1, right)
                        merge(arr, left, right, mid)
                return arr

        print('\nmerge sort')
        arr = copy.deepcopy(lst)
        t0 = time.time()
        mergesort(arr, 0, n - 1)
        print(time.time() - t0)
        if out:
                print(arr)

bubble_sort(numbers, out)
insertion_sort(numbers, out)
selection_sort(numbers, out)
quick_sort(numbers, out)
merge_sort(numbers, out)
python_sort(numbers, out)