SmallPythonPrograms/merge_sort.py at master · cartoonshow57/SmallPythonPrograms · 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
"""
Implementation of merge sort
"""


def merge_sort(arr):
    if len(arr) > 1:
        mid = len(arr) // 2
        leftarr = arr[: mid]
        rightarr = arr[mid:]
        merge_sort(leftarr)
        merge_sort(rightarr)

        i = j = k = 0

        while i < len(leftarr) and j < len(rightarr):
            if leftarr[i] < rightarr[j]:
                arr[k] = leftarr[i]
                i += 1
            else:
                arr[k] = rightarr[j]
                j += 1
            k += 1

        while i < len(leftarr):
            arr[k] = leftarr[i]
            i += 1
            k += 1

        while j < len(rightarr):
            arr[k] = rightarr[j]
            j += 1
            k += 1

    return arr


array = list(map(int, input('Enter array elements: ').strip().split()))

print('Given array is: ', array)
print('Sorted array: ', merge_sort(array))

input()