Skip to content

Qn-10.c

Problem Statement

Write a C program to find the maximum element in each row of a 2D array and print the result.

Metadata

Property Detail
Author Amit Dutta amitdutta4255@gmail.com
Date 06 Mar 2026
License MIT License (See the LICENSE file for details)
Difficulty Beginner (index: 2 / 10)

Concepts

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

  • Recursion
  • Array
  • Sorting (possible)
  • Iteration

Actions

Raw View on GitHub

You can print or save this file by opening Raw and using your browser.

Source Code

#include <stdio.h>

void findMax(int row, int col, int[row][col]);

int main()
{
    int row = 3, col = 3, i, j, val = 1;
    int arr[row][col];
    for (i = 0; i < row; i++)
    {
        for (j = 0; j < col; j++)
        {
            arr[i][j] = val++;
        }
    }
    findMax(row, col, arr);
    return 0;
}

void findMax(int row, int col, int arr[row][col])
{
    int i, j;
    int max;
    for (i = 0; i < row; i++)
    {
        max = arr[i][0];
        for (j = 0; j < col; j++)
        {
            if(max < arr[i][j]) {
                max = arr[i][j];
            }
        }
        printf("Max of row %d = %d\n", i, max);
    }
}

Explanation

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (Qn-10.c):

    #include <stdio.h>

    void findMax(int row, int col, int[row][col]);

    int main()
    {
        int row = 3, col = 3, i, j, val = 1;
        int arr[row][col];
        for (i = 0; i < row; i++)
        {
            for (j = 0; j < col; j++)
            {
                arr[i][j] = val++;
            }
        }
        findMax(row, col, arr);
        return 0;
    }

    void findMax(int row, int col, int arr[row][col])
    {
        int i, j;
        int max;
        for (i = 0; i < row; i++)
        {
            max = arr[i][0];
            for (j = 0; j < col; j++)
            {
                if(max < arr[i][j]) {
                    max = arr[i][j];
                }
            }
            printf("Max of row %d = %d\n", i, max);
        }
    }