insertionSort.py

//Insertion Sort

for i in range(n);
k=L[i]
J=i-1
while j>0 and k<L[j]:
L[j+1] = L[j]
j=j-1
else:
L[j+1]=k
print('Sorted list : ' , L)

//Time complexity O(N^2)