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

1 vote159 views1 answer
Ctypes run as administrator
Python
2 votes163 views1 answer
Python string remove whitespace and newlines
Python
0 vote143 views2 answers
Count specific instances in a columb in pandas
Python
0 vote186 views1 answer
Statistique in python
Python
0 vote154 views1 answer
How to use drf pagination directly
Python
2 votes176 views1 answer
Python argparse ignore unrecognized arguments
Python
0 vote146 views1 answer
Aws lambda logging with python logging library
Python
81 votes177 views6 answers
Check python version
Python
0 vote158 views1 answer
Group by, aggregate multiple column -pandas
Python
0 vote139 views1 answer
Python print functoin
Python