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

6 votes137 views2 answers
How to check if django is installed( in python shell)
Python Django
0 vote95 views2 answers
Replicate python
Python
1 vote105 views1 answer
Keep the user logged in even though user changes password django
Python
2 votes60 views3 answers
Label encoding column pandas
Python
4 votes94 views1 answer
Pandas ttable with sum totals
Python
2 votes100 views2 answers
Python snippets
Python
1 vote102 views1 answer
Python roll a die
Python
0 vote110 views1 answer
How to save model to a file python
Python
0 vote112 views2 answers
Python split word into letter pairs
Python
0 vote103 views1 answer
Return all values in a list python
Python