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

3 votes395 views5 answers
Remove unnamed 0 column pandas
Python
0 vote433 views1 answer
Decode in django templates
Python Django
8 votes377 views3 answers
Python split range into n groups
Python
0 vote329 views1 answer
How to create a joystick in pyqt4
Python
0 vote332 views4 answers
Client network socket disconnected before secure TLS connection was established
Python
1 vote361 views1 answer
Number of database queries django
Python
-1 vote346 views1 answer
Python return double quotes instead of single
Python
1 vote409 views1 answer
Esp8266 micropython ds18b20
Python
0 vote310 views1 answer
Python read textfile
Python
0 vote371 views2 answers
Closures in python
Python