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 vote186 views2 answers
Tree python
Python
3 votes172 views1 answer
Get biggest value in array python3
Python
0 vote164 views1 answer
Python get desktop environment
Python
13 votes190 views1 answer
Install fastapi
Python
13 votes174 views6 answers
Python if elif else
Python
0 vote191 views1 answer
Python import colors
Python
0 vote195 views1 answer
Isprime lambda python
Python
11 votes157 views2 answers
Python functions with input
Python
1 vote172 views2 answers
Django queryset exists
Python
2 votes192 views1 answer
ValueError: Tz-aware datetime.datetime cannot be converted to datetime64 unless utc=True site:stackoverflow.com
Python