Insertion Sort
#include <stdio.h> int main() { int length=6, i, j, k, key; int A[6]={5,2,4,6,1,3}; for (j=1; j<=length; j++){ key=A[j]; i=j-1; while (i>=0 && A[i]>key){ A[i+1]=A[i]; i=i-1; } A[i+1]=key; } for (i=0;i<length;i++){ printf( "%d " , A[i]); } return 0; }