## Insertion Sort in Python

Insertion Sort in Python Insertion sort examine the previously sorted sub-array and insert an element at its proper position. If you have an array a[0], a[1], a[2], a[3],……….a[n]. Then in insertion sort a[0] trivially sorted sub-array. Again compare a[0] to a[1] and if a[0]> a[1] exchange it. Now sub-array a[0],a[1] is sorted again compare a[2] … Read more Insertion Sort in Python