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

2 votes268 views2 answers
List of seaborn color palette
Python
1 vote239 views1 answer
Convert array to set python
Python
0 vote293 views1 answer
Django not detecting new model
Python Django
0 vote329 views1 answer
Dev.to flask heroku
Python
0 vote251 views2 answers
Value is not a valid dict (type=type_error.dict) response_model fastapi
Python
0 vote279 views1 answer
Model o weight
Python
0 vote252 views1 answer
Dice throw program in python
Python
0 vote272 views1 answer
Difference in django project view and app view
Python
19 votes252 views2 answers
Ignore warnings
Python
1 vote263 views2 answers
Keras.callbacks.history
Python