Mostrar comentarios más antiguos
Write a function called halfsum that takes as input an at most two-dimensional array A and computes the sum of the elements of A that are in the lower right triangular part of A, that is, elements in the counter-diagonal (going from the bottom left corner, up and to the right) and elements that are to the right of it. For example, if the input is [1 2; 3 4; 5 6; 7 8], then the function would return 21.
8 comentarios
SAYANTAN BHANJA
el 15 de Jul. de 2017
James Tursa
el 15 de Jul. de 2017
Editada: James Tursa
el 15 de Jul. de 2017
The fact that you are testing for the explicit conditions of r==2 and c==2 leads me to believe that you are interpreting this condition incorrectly:
"... at most two-dimensional array A ..."
That phrase simply means that A has at most two dimensions. I.e., A is either a row vector or a column vector or a 2D matrix. It can't be a 3D or 4D etc array. E.g. the variable A could be 1x9 or 22x1 or 34x23, but it cannot be 3x4x5 nor 4x8x2x7 etc. It doesn't mean that one of the dimension values must be 2.
Because of this, it appears to me that you are making this more complicated than you need to. E.g., at most you would only need to cover two cases in your code if you want something similar to the logic you have shown thus far:
if( r > c )
% code for this case here
else
% code for the r <= c case here
end
SAYANTAN BHANJA
el 15 de Jul. de 2017
James Tursa
el 15 de Jul. de 2017
OK, let's make it simpler. 0-pad the incoming matrix to make it square, and then deal with the square matrix downstream in your code:
[r,c] = size(x);
if( r < c )
x = new matrix padded with 0's on top to make it square
else
x = new matrix padded with 0's on right to make it square
end
% then deal with the square matrix x downstream
So, first figure out how to do the padding. Then the downstream stuff you should be able to figure out using logic very similar to what you already have shown above.
SAYANTAN BHANJA
el 16 de Jul. de 2017
SAYANTAN BHANJA
el 16 de Jul. de 2017
Jorge Briceño
el 3 de Feb. de 2018
Hi everyone,
I solved the problem in two ways.
First one, using two for loops.
function [counter] = halfsum (A)
% ii = rows ; jj = columns
[m,n]=size(A);
counter = 0;
col=1;
for ii=m:-1:1
for jj=col:n
counter=counter + A(ii,jj);
end
col=col+1; % This line will add a number to your column value,
% so you will not start in the first column again.
end
counter;
end
Second one, using a for loop and an if statement.
function [counter] = halfsum (A)
% ii = rows ; jj = columns
[m,n]=size(A);
counter = 0;
ii=m;
for jj=1:n
if ii>0 % This contidion is mandatory, otherwise the ii could be equal zero, which will result in an error
counter=counter + sum(A(ii,jj:n)); % Function sum(A(ii,jj:n)) sums all the column in a row.
ii=ii-1; % This is equivalent to a row for loop.
end
end
counter;
end
I hope it helps.
Cheers!
Respuestas (3)
Image Analyst
el 11 de Jul. de 2017
0 votos
Hints. Look at functions size() (to get the size of the matrix), and sum(), tril(), triu(), flipud(), and/or flidlr(). Or simply use a nested for loop for a brute force method.
Srishti Saha
el 7 de Abr. de 2018
This code works perfectly for me:
%function to compute sum of lower most right side triangle in an X*2 matrix
function u = halfsum(P)
u1 = P(end:-1:1, 1:end);
u2 = triu(u1);
u = sum(u2(:));
end
RAMAKANT SHAKYA
el 7 de Feb. de 2019
Editada: RAMAKANT SHAKYA
el 8 de Feb. de 2019
function s=halfsum(a)
[m,n]=size(a);
s=0;
a=flip(a);
for r=1:m
for c=n:-1:r
s=s+a(r,c);
end
end
end
2 comentarios
Image Analyst
el 8 de Feb. de 2019
Do not use the built-in function sum() as the name of your variable. Call it theSum or something other than sum.
RAMAKANT SHAKYA
el 8 de Feb. de 2019
thank you sir for improving me.
Categorías
Más información sobre Creating and Concatenating Matrices en Centro de ayuda y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!