Hello, here is two programs;

1.Given matrix NxM. Get sequence b1 ,….,bn , where bk the largest element of row k.

2. Enter an integer N. Enter a whole number N x M to the table. The following table each row to find the minimum number, then the maximum. Print found in the number of coordinates (row, column).

For first i have tried this:

is it correct?Code:#include <stdio.h> #include <stdlib.h> #define SIZE 10 void ivesti_matrica( int matrica[][3], int eiluciu_sk); void spausdinti_matrica( int matrica[][3], int eiluciu_sk); void burbulas(int matrica[][3], int burbulas); int main() { int a [3][3]; printf("Prasom ivedineti matricos elementus \n"); ivesti_matrica(a,3); printf("Ivesta matrica: \n"); spausdinti_matrica(a,3); system("pause"); return 0;} void ivesti_matrica( int matrica[][3], int eiluciu_sk) { int i,j; for (i=0;i<eiluciu_sk;i++) for (j=0;j<eiluciu_sk;j++) { printf("Iveskite a[%d,%d]elementa ",i+1,j+1); scanf("%d",&matrica[i][j]); }} void spausdinti_matrica( int matrica[][3], int eiluciu_sk) { int i,j; for (i=0;i<eiluciu_sk;i++) { for (j=0;j<eiluciu_sk;j++) printf("%4d",matrica[i][j]); printf("\n");} void burbulas(int matrica[][3] , int burbulas); printf ("Surusiuotas masyvas: \n"); for (i=0;i<SIZE;i++) for (j=0;j<SIZE;i==); printf ("%4d",matrica[i][j]); printf("\n"); system("pause"); return 0;}