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

11 votes275 views1 answer
Python requests wait for page to load
Python
0 vote280 views1 answer
Tree recursive function
Python
1 vote257 views1 answer
Django jinja subset string
Python
0 vote276 views1 answer
Django redirect to external url
Python
0 vote292 views1 answer
Tkinter titre fenetre
Python
1 vote257 views1 answer
Cursor python
Python
0 vote320 views1 answer
How to add static files in django 3.2.9
Python Django
0 vote262 views1 answer
Create a python file and import it as library in other file
Python
2 votes280 views1 answer
Truncate templat tag django
Python
56 votes293 views5 answers
Python format datetime
Python