Statistiques
0 Questions
2 Réponses
RANG
172 470
of 300 863
RÉPUTATION
0
CONTRIBUTIONS
0 Questions
2 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
0
RANG
of 21 100
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 171 413
CONTRIBUTIONS
0 Problèmes
0 Solutions
SCORE
0
NOMBRE DE BADGES
0
CONTRIBUTIONS
0 Publications
CONTRIBUTIONS
0 Public Chaîne
CLASSEMENT MOYEN
CONTRIBUTIONS
0 Point fort
NOMBRE MOYEN DE LIKES
Feeds
Write a function called max_sum that takes v, a row vector of numbers, and n, a positive integer as inputs. The function needs to find the n consecutive elements of v whose sum is the largest possible.
function [summa,index] = max_sum(A,n) if length(A)< n summa = 0; index = -1; return; end summa = -inf; index ...
plus de 5 ans il y a | 0
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
function summa = halfsum(A) [row col] = size(A); total = 0; for r = 1:row for c= r:col total = total + A(r,c)...
plus de 5 ans il y a | 0
