Merge_sort

def mergeSort(arr):
    if len(arr) > 1:
        mid = len(arr)//2
        L = arr[:mid]
        R = arr[mid:]
        mergeSort(L)
        mergeSort(R)
        i = j = k = 0
        while i < len(L) and j < len(R):
            if L[i] < R[j]:
                arr[k] = L[i]
                i += 1
            else:
                arr[k] = R[j]
                j += 1
            k += 1
        while i < len(L):
            arr[k] = L[i]
            i += 1
            k += 1
        while j < len(R):
            arr[k] = R[j]
            j += 1
            k += 1
def printList(arr):
    for i in range(len(arr)):
        print(arr[i], end=" ")
    print()
if __name__ == '__main__':
    arr = [12, 11, 13, 5, 6, 7]
    print("Given array is", end="\n")
    printList(arr)
    mergeSort(arr)
    print("Sorted array is: ", end="\n")
    printList(arr)

Source: geeksforgeeks.org

Similar codes

5 votes186 views2 answers
Read matlab file in python
Python
0 vote196 views7 answers
Convert java code to python online
Python
1 vote185 views1 answer
Python delete text in text file
Python
8 votes160 views4 answers
Len function in python
Python
0 vote164 views1 answer
How to open camre aopencv
Python
1 vote163 views1 answer
Python roll a die
Python
5 votes185 views4 answers
Python requests post
Python
1 vote166 views1 answer
Python if elif else in one line
Python
0 vote184 views1 answer
No module named 'bootstrap4' django
Python
0 vote188 views1 answer
Python tkinter checkbox default value
Python