# Insertion sort

# def insertionSort(arr, n):

#     for i in range(1,n):

#         for j in range(i,0,-1):

#             if arr[j] < arr[j-1]:

#                 arr[j],arr[j-1] = arr[j-1],arr[j]

#     return arr


# arr = [5, 9, 2, 4, 3, 1]
# print(insertionSort(arr, len(arr)))
