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 vote238 views1 answer
Python 2.7 check if variable is none
Python
0 vote267 views1 answer
What is {:02d}:{:02d} in python
Python
26 votes265 views5 answers
Is_integer Python
Python
5 votes245 views2 answers
Python get everything between two characters
Python
43 votes316 views6 answers
Reverse string python
Python
2 votes254 views2 answers
Php echo shorthand
Python
0 vote271 views1 answer
Generate random numbers following Poisson distribution, Geometric Distribution, Uniform Distribution, and Normal Distribution, and plot them
Python
3 votes227 views1 answer
GdScript string format
Python
0 vote253 views1 answer
Renomear colunas pandas
Python
1 vote266 views2 answers
Virtual env python 2
Python