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 vote129 views1 answer
GdScript int
Python
1 vote141 views5 answers
LibGLU.so.1: cannot open shared object file: No such file or directory
Python
32 votes189 views6 answers
Merge pandas
Python
0 vote166 views1 answer
Python cholesky
Python
2 votes130 views2 answers
How to split a list to 1000 items python
Python
1 vote181 views1 answer
Python exit button
Python
0 vote144 views1 answer
Df index start from 1
Python
0 vote143 views1 answer
Create nested dictionary with user input in python
Python
0 vote103 views1 answer
Headless chrome python
Python
2 votes151 views1 answer
How to make pyautogui search a region of the screen
Python