Data-Sorting-Visualized/mergeSortAlgorithm.py at main · PyricRL/Data-Sorting-Visualized · 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
import time

import sortingUtils
from sortingUtils import wait

startTime = 0

def mergeSort(array, left, right, delay):
    global startTime
    if left == 0 and right == len(array) - 1:
        startTime = time.perf_counter()

    if left < right:
        mid = (left + right) // 2

        yield from mergeSort(array, left, mid, delay)
        yield from mergeSort(array, mid + 1, right, delay)
        yield from merge(array, left, mid, right, delay)
    if left == 0 and right == len(array) - 1:
        sortingUtils.sortTimeVisual = time.perf_counter() - startTime

def merge(array, left, mid, right, delay):
    global startTime
    n1 = mid - left + 1
    n2 = right - mid

    L = [0] * n1
    R = [0] * n2

    for i in range(n1):
        L[i] = array[left + i]

    for j in range(n2):
        R[j] = array[mid + 1 + j]

    i = 0
    j = 0
    k = left

    while i < n1 and j < n2:
        sortingUtils.comparedIndices.clear()
        sortingUtils.selectedIndices.clear()

        sortingUtils.selectedIndices.append(k)
        sortingUtils.comparedIndices.append(left + i)
        sortingUtils.comparisons += 1
        if L[i] <= R[j]:
            array[k] = L[i]
            i += 1
        else:
            array[k] = R[j]
            j += 1
            sortingUtils.comparedIndices.append(mid + 1 + j)
            sortingUtils.swaps += 1
            sortingUtils.swapDataSound.play()
        sortingUtils.sortTimeVisual = time.perf_counter() - startTime
        k += 1
        yield
        wait(delay)

    while i < n1:
        sortingUtils.selectedIndices.append(k)
        sortingUtils.comparedIndices.append(left + i)
        array[k] = L[i]
        i += 1
        k += 1
        sortingUtils.swaps += 1
        sortingUtils.swapDataSound.play()
        yield
        wait(delay)

    while j < n2:
        sortingUtils.selectedIndices.append(k)
        sortingUtils.comparedIndices.append(mid + 1 + j)
        array[k] = R[j]
        j += 1
        k += 1
        sortingUtils.swaps += 1
        sortingUtils.swapDataSound.play()
        yield
        wait(delay)

def mergeSortNoVisible(array, left, right):
    global startTime
    timeArray = array.copy()

    if left == 0 and right == len(timeArray) - 1:
        startTime = time.perf_counter()

    if left < right:
        mid = (left + right) // 2

        mergeSortNoVisible(timeArray, left, mid)
        mergeSortNoVisible(timeArray, mid + 1, right)
        mergeNoVisible(timeArray, left, mid, right)

    if left == 0 and right == len(timeArray) - 1:
        sortingUtils.sortTime = time.perf_counter() - startTime

def mergeNoVisible(array, left, mid, right):
    n1 = mid - left + 1
    n2 = right - mid

    L = [0] * n1
    R = [0] * n2

    for i in range(n1):
        L[i] = array[left + i]

    for j in range(n2):
        R[j] = array[mid + 1 + j]

    i = 0
    j = 0
    k = left

    while i < n1 and j < n2:
        if L[i] <= R[j]:
            array[k] = L[i]
            i += 1
        else:
            array[k] = R[j]
            j += 1
        k += 1

    while i < n1:
        array[k] = L[i]
        i += 1
        k += 1

    while j < n2:
        array[k] = R[j]
        j += 1
        k += 1