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 vote246 views1 answer
Pandas Columns Calling using read_csv
Python
0 vote246 views1 answer
Mypy Should never get here in normal mode, got NoneType: instead of TypeInfo
Python
0 vote234 views1 answer
Scipy.signal lfilter
Python
0 vote257 views1 answer
Get full detail inside of id in django rest framework many to many
Python
0 vote220 views1 answer
Pyqt menubar example
Python
2 votes231 views2 answers
Install ide python ubuntu
Python
1 vote227 views1 answer
Python count code, Count number of occurrences of a given substring
Python
0 vote259 views2 answers
Loop only to the 6th element python
Python
0 vote243 views1 answer
Getting tradingview historical data using python
Python
0 vote242 views1 answer
Convert string to integer in dictionary python
Python