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

2 votes184 views1 answer
And condition with or in django
Python Django
9 votes150 views3 answers
Pyramid pattern in python
Python
0 vote144 views1 answer
Label_map dict = label_map_util.get_label_map_dict(label_map)
Python
57 votes144 views6 answers
Print current date and time in python
Python
0 vote181 views1 answer
How to overlap two barplots in seaborn
Python
0 vote193 views1 answer
Pyqt highlight all occurrences of selected word qt
Python
1 vote141 views1 answer
Tf.contrib.layers.xavier_initializer() tf2
Python
0 vote139 views1 answer
Os file size python
Python
12 votes202 views6 answers
Python progress bar
Python
1 vote172 views1 answer
Insert data in django models
Python Django