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 vote152 views2 answers
How to put a header title per dataframe after concatenate using pandas in python
Python
0 vote147 views1 answer
Tensor.numpy() pytorch gpu
Python
0 vote139 views1 answer
Views.MainView.as_view(), name='all'
Python
2 votes158 views2 answers
How to install pywin32 python
Python
0 vote141 views2 answers
Return list python
Python
1 vote163 views1 answer
Qslider pyqt
Python
0 vote182 views1 answer
Get most recent file in directory python
Python
0 vote149 views1 answer
Dont limit padnas jupyter
Python
0 vote151 views1 answer
MyTestCase
Python
48 votes141 views6 answers
Python read file line by line
Python