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 vote342 views3 answers
Django custom authentication
Python
3 votes332 views3 answers
Pandas date_range
Python
0 vote335 views1 answer
How to join models from another app
Python
-1 vote302 views1 answer
Expected ")" pylance python
Python
2 votes337 views3 answers
Group by month and day pandas
Python
0 vote334 views1 answer
Python - merge and incluse only specific columns
Python
8 votes401 views5 answers
No module psycopg2
Python
0 vote343 views1 answer
Default dictionary value
Python
5 votes403 views3 answers
Sys module in python
Python
4 votes331 views1 answer
Numpy mean 2 arrays
Python