INSERTION SORT

ALGORITHM


1.J=2 TO N
2. key=a[j];
3.  i=j-1;
4.  for i>0 and a[i]>key
5. a[i+1]=a[i];
6. i=i-1;
7. a[i+1]=key;

TIME COMPLEXITY 
BEST CASE=THITA(N)
WORST CASE=THITA(N^2)