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 vote153 views1 answer
Uneven chunks of array slices
Python
0 vote211 views1 answer
What is certifi module in python
Python
36 votes224 views3 answers
Python image library
Python
21 votes377 views4 answers
Flask quickstart
Python Flask
0 vote204 views3 answers
Django add user to group
Python
0 vote202 views1 answer
Python site-packages pyspark
Python
0 vote183 views1 answer
How to compare list and int in python
Python
0 vote193 views1 answer
How to delete all instances of a model in django
Python
0 vote200 views1 answer
Add vertical line to horizontal graph
Python
0 vote233 views3 answers
Pep8 E302
Python