def 

insertionSort(arr):
    for i in range(1,len(arr)):
        value=arr[i]
        j=i-1
        while j>=0 and value<arr[j]:
            arr[j+1]=arr[j]
            j-=1
            arr[j+1]=value
    return arr

arr=[10,5,13,8,2]
print("Array Before Sorting:", arr)
insertionSort(arr)
print("Array After Sorting:",arr)

Output: