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

25 votes148 views6 answers
Uninstall all packages python
Python
0 vote149 views1 answer
Python reading csv files from web
Python
0 vote160 views2 answers
Mkvirtualenv python version
Python
0 vote155 views1 answer
Get the invite url of server disc.py
Python
10 votes146 views2 answers
With open as file python
Python
4 votes187 views1 answer
Convert string to lowercase in python
Python
0 vote199 views2 answers
Url namespaces for django rest router urls
Python Django
18 votes102 views1 answer
Dataframe tolist python
Python
2 votes162 views1 answer
Save pandas dataframe to parquet
Python
31 votes157 views1 answer
Télécharger dataframe python extract
Python