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 vote191 views1 answer
Codeforces 233 a solution python
Python
0 vote190 views1 answer
Settings urls
Python
-1 vote257 views1 answer
Count duplicates in one column pandas
Python
0 vote227 views1 answer
Requests.Session() proxies
Python
1 vote192 views2 answers
Pandas groupby max multiple columns in pandas
Python
1 vote593 views1 answer
Inverse list python
Python
7 votes199 views2 answers
Python prime check
Python
4 votes198 views1 answer
Tkinter change label text color
Python
13 votes272 views6 answers
Django orm
Python Django
2 votes192 views2 answers
Trim starting space python
Python