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 vote252 views1 answer
Matplotlib boxplot remove outliers
Python
1 vote220 views1 answer
Python get cpu info
Python
0 vote225 views1 answer
Request.build_absolute_uri django
Python
5 votes225 views2 answers
Convert every element in list to string python
Python
0 vote241 views2 answers
Convert string to list of dictionaries
Python
33 votes229 views2 answers
Python bytes
Python
9 votes227 views1 answer
Save an image in python as grayscale cv2
Python
1 vote254 views2 answers
To see version matplotlib
Python
66 votes220 views6 answers
Python for loop index
Python
13 votes247 views3 answers
Pygame mouse pos
Python