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 vote363 views1 answer
Bolumden kalan python
Python
30 votes338 views2 answers
Matplotlib change text size
Python
2 votes332 views3 answers
Python how to get directory of script
Python
4 votes305 views1 answer
Get dir python
Python
0 vote341 views1 answer
How to get coupons from honey in python
Python
0 vote320 views1 answer
Django choicefield empty label
Python
2 votes356 views4 answers
Pandas frequency
Python
0 vote322 views1 answer
Python extract list from string
Python
0 vote319 views1 answer
Create a dict from variables and give name
Python
0 vote325 views1 answer
How to access dataframe row by datetime index
Python