**Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.**

**Time Complexity:** O(n*2)

**Auxiliary Space: **O(1)

**Python program for implementation of Insertion Sort :**

**a=[12,11,8,5,3]**

**for i in range(1,len(a)):**

** k=a[i]**

** j=i-1**

** **

** while j>=0 and k<a[j]:**

** a[j+1]=a[j]**

** j-=1**

** a[j+1]=k**

**print(a)**