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 vote306 views2 answers
Python in intellij
Python
1 vote333 views1 answer
How to remove numbers from string in python pandas
Python
2 votes329 views3 answers
Rotate matrix 90 degrees clockwise python
Python
3 votes307 views2 answers
Pygame change logo
Python
0 vote323 views1 answer
Remove toggle/pandaslux
Python
1 vote366 views1 answer
Qslider pyqt
Python
1 vote288 views2 answers
Download pdf from url python
Python
0 vote369 views1 answer
Delete migrations django and start over deployment heroku
Python Django
35 votes329 views6 answers
How to make a virtual environment python 3
Python
13 votes320 views2 answers
Slug
Python