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

0 vote223 views1 answer
Divide every element in numpy array
Python
2 votes231 views1 answer
Python turtle background image
Python
0 vote197 views1 answer
Python listas por comprension
Python
0 vote200 views1 answer
Merge two query sets django
Python Django
0 vote192 views1 answer
How to get the positions where values of two columns match?
Python
2 votes209 views2 answers
Copy image from one folder to another in python
Python
1 vote188 views1 answer
Python sftp put file
Python
0 vote219 views1 answer
Webview_flutter
Python
1 vote217 views2 answers
Python map list of int to string
Python
3 votes195 views1 answer
Ipython autoreload
Python