Data-Sorting-Visualized/cocktailSortAlgorithm.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
import time

import sortingUtils
from sortingUtils import isSorted, wait

def cocktailSort(array, delay):
    swapped = True
    start = 0
    end = len(array) - 1
    startTime = time.perf_counter()

    while not isSorted(array) and sortingUtils.sorting:
        swapped = False

        for i in range(start, end):
            sortingUtils.comparisons += 1
            sortingUtils.selectedIndices.clear()
            sortingUtils.comparedIndices.clear()
            sortingUtils.selectedIndices.append(i)
            if (array[i] > array[i + 1]):
                array[i], array[i + 1] = array[i + 1], array[i]
                sortingUtils.swaps += 1
                sortingUtils.comparedIndices.append(i + 1)
                sortingUtils.swapDataSound.play()
                swapped = True
                yield
            sortingUtils.sortTimeVisual = time.perf_counter() - startTime
            wait(delay)

        if not swapped:
            break

        swapped = False

        end = end - 1

        for i in range(end - 1, start - 1, -1):
            sortingUtils.comparisons += 1
            sortingUtils.selectedIndices.clear()
            sortingUtils.comparedIndices.clear()
            sortingUtils.selectedIndices.append(i)
            if (array[i] > array[i + 1]):
                array[i], array[i + 1] = array[i + 1], array[i]
                sortingUtils.swaps += 1
                sortingUtils.comparedIndices.append(i + 1)
                sortingUtils.swapDataSound.play()
                swapped = True
                yield
            sortingUtils.sortTimeVisual = time.perf_counter() - startTime
            wait(delay)

        start = start + 1

def cocktailSortNoVisible(array):
    timeArray = array.copy()
    startTime = time.perf_counter()
    swapped = False
    start = 0
    end = len(array) - 1

    while not isSorted(array) and sortingUtils.sorting:
        swapped = False

        for i in range(start, end):
            if (timeArray[i] > timeArray[i + 1]):
                timeArray[i], timeArray[i + 1] = timeArray[i + 1], timeArray[i]
                swapped = True

        if not swapped:
            break

        swapped = False

        end = end - 1

        for i in range(end - 1, start - 1, -1):
            if (timeArray[i] > timeArray[i + 1]):
                timeArray[i], timeArray[i + 1] = timeArray[i + 1], timeArray[i]
                swapped = True

        start = start + 1
    sortingUtils.sortTime = time.perf_counter() - startTime