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 vote110 views1 answer
While importing we detected an older version of numpy in
Python
3 votes118 views2 answers
Priting matrix using np truncating the output
Python
12 votes122 views2 answers
Online ide for python 3
Python
5 votes101 views2 answers
How to make a calcukatir un python
Python
22 votes116 views2 answers
Reset_index(drop=true)
Python
0 vote117 views1 answer
No module named 'bootstrap4' django
Python
19 votes160 views3 answers
Simplified if else python
Python
0 vote120 views1 answer
Sklearn logistic regression get probability
Python
1 vote123 views1 answer
Python how to sort by date
Python
1 vote107 views1 answer
Convert list of values to dictionary based on count
Python