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

1 vote111 views2 answers
How to download python freegames
Python
-1 vote118 views1 answer
Pathlib change extension
Python
0 vote192 views1 answer
Flask recive list
Python Flask
5 votes127 views2 answers
Get_object_or_404 django
Python
0 vote126 views1 answer
Module installed but not found python
Python
17 votes124 views5 answers
Remove punctuation python
Python
2 votes113 views2 answers
Python snippets
Python
0 vote68 views1 answer
5+2 in python
Python
4 votes111 views1 answer
Python - show all columns / rows of a Pandas Dataframe
Python
1 vote114 views1 answer
.replit file python
Python