Homework 4

#include <stdio.h>
#include <limits.h>

int max2DArray(int a[6][5])
{
    int max = -INT_MAX;
    int i, j;
    for(i = 0; i < 6; i++)
        for(j = 0; j < 5; j++)
            if(a[i][j] > max)
                max = a[i][j];
    return max;
}

int sum2DArray(int a[6][5])
{
    int S=0, i, j;
    for(i = 0; i < 6; i++)
        for(j = 0; j < 5; j++)
            S += a[i][j];
    return S;
}

int find2DArray(int a[6][5], int v)
{
    int i, j;
    for(i = 0; i < 6; i++)
        for(j = 0; j < 5; j++)
            if(v == a[i][j])
                return 1;
    return 0;
}
int main()
{
    int v;
    FILE *fp;
    fp = fopen("matrice.txt", "r");
    int a[6][5], i, j;
    for(i = 0; i < 6; i++)
        for(j = 0; j < 5; j++) {
       //     printf("a[%d][%d] = ", i, j);
            fscanf(fp, "%d", &a[i][j]);
        }
    for(i = 0; i < 6; i++) {
        for(j = 0; j< 5; j++)
            printf("%d ", a[i][j]);
        printf("\n");
    }
    printf("Mx: %d\n", max2DArray(a));
    printf("Sum: %d\n", sum2DArray(a));
    printf("Value to be found: ");
    scanf("%d", &v);
    if(!find2DArray(a, v))
        printf("Value was not found.");
    else printf("Value was found.");
    return 0;
}