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 vote278 views1 answer
Django model make the field caseinsensitive
Python
2 votes364 views3 answers
Get absolute url django
Python Django
1 vote275 views1 answer
5**5
Python
0 vote276 views1 answer
Python developer job description
Python
17 votes286 views4 answers
Python delete directory contents
Python
0 vote268 views1 answer
Check if back is pressed python
Python
3 votes382 views2 answers
List images in directory python
Python
6 votes290 views3 answers
How to remove all zeros from a list in python
Python
3 votes253 views3 answers
Nested loop in list comprehension
Python
2 votes292 views3 answers
Pandas count occurrences of certain value in row
Python