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 vote268 views1 answer
Axes turn of axis matplotlb
Python
0 vote281 views1 answer
Resize a Turtle object
Python
0 vote309 views1 answer
Pytorch torchaudio torchvision cu113
Python
0 vote284 views1 answer
Pickle.load from gpu device to cpu
Python
0 vote322 views1 answer
"must be called with either an object pk or a slug in the URLconf"
Python
0 vote266 views1 answer
Pystache unescaped characters
Python
3 votes292 views2 answers
Lda scikit learn
Python
0 vote275 views1 answer
Atan2 of number python
Python
0 vote293 views4 answers
New line in jupyter notebook markdown
Python
0 vote274 views1 answer
Train_test_split without shuffle
Python