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

3 votes173 views3 answers
Close a file python
Python
1 vote176 views1 answer
Why is there a lot of numbers in python
Python
1 vote180 views1 answer
Hcf program in python
Python
0 vote192 views1 answer
Numpy how to dropzero
Python
0 vote196 views1 answer
Get tensorflow version version in ubuntu
Python
10 votes155 views4 answers
Python multiply all elements in list
Python
12 votes187 views4 answers
Remove nan particular column pandas
Python
3 votes169 views3 answers
Dot product python
Python
0 vote169 views1 answer
Make a white image numpy
Python
0 vote158 views1 answer
UTC to ISO 8601 with Local TimeZone information without microsecond (Python 3):
Python