Sort n values using insertion sort method

In this case,the input is sorted while reading and placing it in the array.In all other methods,all input values are placed in array before applying the actual sorting procedure.But here ,the values are sorted while reading them from console.

Basic steps are as follows -

-Read a value form console.

-In order to place it in given array find its position in such a way that after its insertion the resultant data must be in sorted order.

-For this purpose,start shifting the values from bottom of the array downward by one position till getting a proper position.

-Insert a new value after getting its proper position.

#include < stdio.h >
#include < conio.h > 
void main()
{
	int m1[10][10],m2[10][10],m3[10][10];
	int r,c,i,j;	
	clrscr();
	printf("\nEnter r & c : ");
	scanf("%d %d",&r,&c);
	printf("\nEnter first matrix of size %d X %d\n",r,c);
	for(i=0;i < r ; i ++)
	{
		for(j=0;j < c;j++)
		{
			scanf("%d",&m1[i][j]);
		}
	}
	printf("\nEnter second matrix of size %d X %d\n",r,c);
	for(i=0;i < r ; i ++)
	{
		for(j=0;j < c;j++)
		{
			scanf("%d",&m2[i][j]);
		}
	}
	//... find addition ......
	for(i=0;i < r;i++)
	{
		for(j=0;j < c;j++)
		{
			m3[i][j] = m1[i][j] + m2[i][j];
		}
	}
	printf("\nFirst matrix is\n");
	for(i=0;i< r;i++)
	{
		for(j=0;j < c;j++)
		{
			printf("%4d",m1[i][j]);
		}
		printf("\n");
	} // for
	printf("\nSecond matrix is\n");
	for(i=0;i < r;i++)
	{
		for(j=0;j < c;j++)
		{
			printf("%4d",m2[i][j]);
		}
		printf("\n");
	} // for
	printf("\nThe addition is \n");
	
	for(i=0;i < r;i++)
	{
		for(j=0;j < c;j++)
		{
			printf("%4d",m3[i][j]);
		}
		printf("\n");
	} // for
} // main