Insertion sort

 What is inertion sort?

Insertion sort

def insertionSort(arr): 

  

    for i in range(1, len(arr)): 

        pprint(arr)

        key = arr[i] 

        j = i-1

        while j >= 0 and key < arr[j] : 

                arr[j + 1] = arr[j] 

                j -= 1

        arr[j + 1] = key

        


def pprint(arr):

    for i in arr:

        print(i ,end='\t')

    print()



arr=list(int(x) for x in input("Enter elements separated by ',' ").split(","))

insertionSort(arr)

pprint(arr)