python-test/QuickSort.py at main · Killingrace/python-test · 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
class QuickSort:
    arr = [ ]


    def __init__(self, arr):
        self.arr = arr


    def piv(self, arr):

        left_arr = [ ]
        right_arr = [ ]
        pivot = arr[-1]

        for i in arr[:-1]:

            if pivot > i:
                left_arr.append(i)
            else: right_arr.append(i)

        return (left_arr + [pivot] + right_arr), len(left_arr)


    def sort(self, min, max):

        if min < max:

            sub_arr = self.arr[min : max + 1]
            sort_sub_arr, pivot_index  = self.piv(sub_arr)
            self.arr[min : max + 1] = sort_sub_arr

            self.sort(min, min + pivot_index - 1)
            self.sort(min + pivot_index + 1, max)


    def __str__(self):

        temp_list = ''

        for i in range(len(self.arr)):
            temp_list += (str(self.arr[i]) + (', ' if i != len(self.arr) -1 else ''))

        return temp_list


def start():

    a = 2; arr = []

    while a:

        a = input("sus: ")
        arr.append(int(a)) if a else ''

    quick = QuickSort(arr)
    quick.sort(0, len(arr)-1)

    print(quick)


start()