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

13 votes300 views3 answers
Pandas reset index start from 0
Python
-1 vote336 views1 answer
Python scatterplot figsize
Python
0 vote294 views1 answer
User_info = user_info.save(commit=False)
Python
0 vote281 views1 answer
Compare two data frames in assert
Python
0 vote281 views1 answer
Python bug
Python
4 votes300 views1 answer
Drop Rows by Index in dataframe
Python
13 votes332 views6 answers
Python tkinter
Python
0 vote326 views2 answers
Print font size python
Python
0 vote340 views1 answer
Check django channels with redis setup
Python Django
2 votes301 views2 answers
Write object to file python
Python