How do I find the smallest elements of a given matrix and then the largest one among them?

Question

1.00/5 (1 vote)

See more:

In a given А=[aij]m×n matrix entered through the keyboard, find the smallest elements in a row and then the biggest one from them (biggest one from the smallest ones). Stuck on this for awhile now, I am noob at c programming btw. I apologize if this seems as an absurdly dumb question, but that's my limit. Would appreciate any answer. Cheers!

What I have tried:

C

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
int a[10][10],maxr[10],maxs[10],i,j,n;
printf("enter rows for the matrix\n");
scanf("%d",&n);
printf("input the elements of the matrix\n");
for(i=0;i++)
{
printf("a[%d][%d]:",i,j);
scanf("%d",&a[j]);
}

Posted 6-Dec-17 2:06am

Member 13561377

Updated 6-Dec-17 2:29am

CPallini

v2

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Accepted Answer · 2017-12-06T02:26:00

Start collecting inputs:

C

#include <stdio.h>
#include <stdlib.h>
#define N 10

int main()
{
  int m[N][N];
  int n,r,c;

  // get matrix dimension
  printf("please enter the number of the rows\n");
  if ( scanf("%d",&n) != 1 || n < 1 || n > N )
  {
    exit(-1); // TODO: better error handling here
  }

  // collect matrix items
  for (r = 0; r < n; ++r)
    for (c = 0; c < n; ++c)
    {
      printf("please enter item[%d][%d]\n", r,c);
      if ( scanf("%d", &m[r][c] ) != 1)
      {
        exit(-1); // TODO: better error handling here
      }
    }

  // show the matrix items
  for (r = 0; r < n; ++r)
  {
    for (c = 0; c < n; ++c)
      printf("%5d", m[r][c]);
    printf("\n");
  }
}

Please note, you don't need arrays to store the candidates to your final result. Just store current minimum of current row and the current maximum (of the minima).

W∴ Balboos, *GHB* · Accepted Answer · 2017-12-06T02:29:00

Things you should do:
1 - separate the problems: input and analysis
2 - Allocate the matrix storage dynamically (size of a[][]), similarly for the other arrays. what if it's 20x3? your code will (probably) crash.
3 - Think simply: you compare two items in a row and keep the smaller, then compare the next one to the current smaller of the first two and keep the smaller of them, etc. etc. etc. until you'd done all the rows.
4 - apply modified (3) to find the largest of the saved smallest values.

Testing your code: create a matrix in code [no scanf()] and use that to test. This eliminates a dependence on input method AND you can easily repeat tries with tedious keyboard input.

How do I find the smallest elements of a given matrix and then the largest one among them?

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0