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

7 votes222 views1 answer
Get inverse dict python
Python
0 vote237 views1 answer
Test pypi
Python
0 vote247 views1 answer
Check correlation of each column with the target in python
Python
1 vote218 views1 answer
Drop every other column pandas
Python
0 vote220 views1 answer
Cv2 pink color range
Python
0 vote201 views2 answers
Python test if you can convert to int
Python
0 vote197 views1 answer
Train_test_split without shuffle
Python
3 votes212 views3 answers
Flask migrate
Python
0 vote237 views1 answer
Pandas df make set index column
Python
0 vote208 views1 answer
How to make images in python
Python