misc/mergeSort.py at master · vishnupoothery/misc · 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
def merge(A,p,q,r):

    n1 = q-p+1

    n2 = r-q

    L = []

    R = []

    for i in range(n1):

        L.append(A[p+i-1])

    for i in range(n2):

        R.append(A[q+i])

    i=0

    j=0

    k=p

    print(p)

    print(q)

    print(r)

    print(n1)

    print(n2)

    print(L)

    print(R)


    while i<n1 and j<n2:

        if L[i] <= R[j]:

            A[k]=L[i]

            i+=1

        else:

            A[k]=R[j]

            j+=1

        k+=1

    while i<n1:

        A[k]=L[i]

        k+=1

        i+=1

    while j<n2:

        A[k]=R[j]

        k+=1

        j+=1


def mergeSort(A,p,r):

    if p<r:

        q=int((p+r)/2)

        mergeSort(A,p,q)

        mergeSort(A,q+1,r)

        merge(A,p,q,r)


n = int(input("Enter array size : "))

arr = []

print("Enter array : ")

for i in range(n):

    a = int(input())

    arr.append(a)


print(arr)


mergeSort(arr,0,len(arr)-1)


print(arr)