...giúp em bài mảng 2 chiều tìm ra gia trị lớn nhất,nhỏ nhất của mỗi dòng
15 46 3.5 6.3
34 0 -25 35
1 +13 46 31
trên màn hình ghi rằng
hàng 1 max=a[1,2]=46 min=a[1,3]=3.5
hàng 2 
hảng 3 tương tự

i=0;
printf("max hàng 1=max[%d] ở vị trí a[%d][%d]",i,i,cotmax[i]);

#include<stdio.h>
main()
	{
	  float a[10]={1.2,-3.4,-7,5,2,5.6,9,-1,10,-2};
	  int i,j,dem,demx,demln;
	  float ln,nn,s;
/*==========================================================*/
s=0;
for (i=-1; i++<9;)
if (a[i] % 2 ==0) s+=a[i];
printf("\n Tong cac phan tu duong = %f",s);
/*==========================================================*/
dem=0;
for(i=-1;i++<9;)
 if ((a[i] % 3==0) && ( a[i] %2==0))
 dem+=1;
 printf("\n so luong phan tu chia het cho 2 va 3 la %d",dem);

#include<stdio.h>
#include<conio.h>
main()
	{
		int  b[]={2,4,6,8,10};
	    int a[]={1,3,5,7,9,11};	  
		int i,j,k,t=0;
	  clrscr();
		for(i=0;i<=4;i++)
			for (j=0;j<=(5+t);j++)
			 if (b[i] < a[j])
				{
				  for(k=(5+t);k>=j;k--)
				    a[j+1]=a[j];
				    a[j]=b[i];
				    t+=1;
				    break;
				}
			 else
			 if ( j==(5+t)) a[5+t+1]=b[i];
			 for(i=0;i<=10;i++)
			 printf("%3d",a[i]);
getch();
    }

#include<stdio.h>
#include<conio.h>
void main()
{
        int a[20]={1,2,4,6,9,17},n=6;
        int b[]={3,6,7,10,11,21},m=6;
        int i,j,t=0;
        for(i=0;i<m;i++)
	{
		if(t==n)//truong hop a[] ko co phan tu nao hoac a[] het nhung b[] con ptu
		{
			for(j=i;j<m;j++)//chep tat ca b[] vao a[]
			{
				a[t++]=b[j];
				n++;
			}
			break;
		}
		if(a[t]>b[i])//chen ptu cua b[] vao a[]
		{
			for(j=n-1;j>=t;j--)
				a[j+1]=a[j];
			a[t]=b[i];
			n++;//tang so phan tu cua a[] len
		}
		else
			i--;//ko cho bien chay cua b[] chay nua
		t++;//tang con tro vi tri cua a[]
		
	}
	//in mang
	for(i=0;i<n;i++)
		printf("%3d",a[i]);
	printf("\n");

}

#include<stdio.h>
#include<conio.h>
void main()
{
	int a[15]={1,3,4,5,9,18},n=6;
	int  b[]={2,6,7,8,10,13,14,17},m=8;
	int i,j,k,t=0;
	for(i=0;i<n;i++)		
		for(j=t;j<m;j++)
			if(b[j]<a[i])//chen ptu cua b[] vao a[]
			{
				for(k=n-1;k>=i;k--)
					a[k+1]=a[k];
				a[i]=b[j];
				n++;//tang so phan tu cua a[] len
				t++;
			}
			else break;		
	if(t<m-1)
		for(k=t;k<m;k++)//chep tat ca b[] vao a[]
			a[n++]=b[k];
	for(i=0;i<n;i++)
		printf("%3d",a[i]);
}

#include<stdio.h>
#include<conio.h>
void main()
{
	int a[15]={1,3,4,5,9,18},n=6;
	int  b[]={2,6,7,8,10,13,14,17},m=8;
 	int i,j,k,t=0;
	for(i=0;i<m;i++)
	{
		for (j=t;j<n;j++)
			if (b[i] < a[j])
			{
				for(k=n-1;k>=j;k--)
					a[k+1]=a[k];
				a[j]=b[i];
				n++;
				t++;
				break;
			}
		if (j==n)
		{
			for(k=i;k<m;k++)
				a[n++]=b[k];
			break;
		}
	}
	for(i=0;i<n;i++)
		printf("%3d",a[i]);
}