How do I find the sum of elements in odd and even rows

Question

0.00/5 (No votes)

See more:

This is my task:
Given an integer matrix of size N. Find the set of the smallest elements of its odd rows and large elements of its even rows.
I don't really know what am i doing wrong.

What I have tried:

#include<conio.h>
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int size;
int min(int *array[][50])
{
	int i,j,min_e=0;
	for (i = 1; i < size; i++)
	{
		for (j = 1; j < size; j++)
		{
			if (array[i][j] < array[min_e])//operand types are incompatible ("int *" and "int **")
			{
				min_e = i;
			}
			return min_e;
		}
	}
}
int x(int array[][50])
{
	int i, j,sum_e=0;
	for (i = 0; i < size; i++)
	{
		for (j = 0; j < size; j++)
		{
			if (i % 2 == 0)
			{
				sum_e += min(array);//argument of type "int (*)[50]" is incompatible with parameter of type "int *(*)[50]
			}
			return sum_e;
		}
	}
	return 0;
}
int max(int array[][50])
{
	int i, j, max_e = 0;
	for (i = 1; i < size; i++)
	{
		for (j = 1; j < size; j++)
		{
		 if (array[i][j] > array[max_e])//operand types are incompatible ("int *" and "int **")			
 
		max_e = i;
		}
		return max_e;
	}
}
int y( int array[50][50])
{
	int i, j, sum_o = 0, o = 0;
	for (i = 0; i < size; i++)
	{
		for (j = 0; j < size; j++)
		{
			if (array[i][j] % 2 == 1)
			{
				sum_o += max(array);//argument of type "int (*)[50]" is incompatible with parameter of type "int *(*)[50]	

			}
		}
		return sum_o;
	}
	return 0;
}
int main()
{
	int array[50][50], i, j;
	printf("\n Size of array: ");
	scanf_s("\n %d", &size);
	for (i = 0; i < size; i++)
	{
		for (j = 0; j < size; j++)
		{
			printf("\n array[%d][%d]: ",i,j);
			scanf_s("\n %d", array[i][j]);
		}
	}
	printf("\n Sum of even-numbered elements \n: ", x(array));
	printf("\n Sum of odd-numbered elements \n: ", y(array));
	_getch();
	return 0;
}

Posted 11-Nov-17 6:59am

Member 13515839

Updated 11-Nov-17 7:49am

Add a Solution

1 solution

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)

KarstenK · Accepted Answer · 2017-11-11T07:49:00

That is a relly simple task, so I give you only some tips:

use clearer var and function names, not x()
use debug output (printf) in critical code pathes like function call and if statement
(remove oe comment out when not more needed)
write some test data, with simple array so you can debug your code

one bug is that your max_e is wrong. You assign the index not the value.

C++

if (array[i][j] > max_e ) {
printf("new max found: %d", array[i][j] );
max_e = array[i][j];//adding one
}

should be correct.

You should also guard that size cant be greater than 50.