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 vote183 views1 answer
Install eric6 python ide ubuntu 20.04
Python
-1 vote211 views1 answer
Binascii.Error: Incorrect padding in python django
Python Django
1 vote175 views1 answer
Koncemzem
Python
0 vote144 views1 answer
Locate certificate path python
Python
4 votes183 views1 answer
How to check opencv version using python
Python
1 vote171 views1 answer
Fasttext python
Python
0 vote222 views1 answer
Wert in array suchen python
Python
13 votes180 views2 answers
Sys get current pythonpath
Python
3 votes226 views1 answer
How to connect templates in django
Python Django
2 votes188 views3 answers
Python get pixel color
Python