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 vote114 views1 answer
Im save to a bytes io python
Python
0 vote125 views2 answers
How to terminate a program cv2 python
Python
4 votes234 views5 answers
Min max python
Python
0 vote140 views1 answer
Tuple count in python
Python
8 votes131 views3 answers
Python csv add row
Python
0 vote140 views1 answer
Pong code python
Python
0 vote172 views1 answer
Threshold meaning in pandas dropna
Python
4 votes127 views3 answers
List methods append in python
Python
0 vote126 views1 answer
Find daily aggregation in pandas
Python
0 vote167 views1 answer
Send message if user is banned discord.py
Python