Statistiques
All
RANG
277 789
of 300 871
RÉPUTATION
0
CONTRIBUTIONS
0 Questions
1 Réponse
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
CONTRIBUTIONS
0 Publications
CONTRIBUTIONS
0 Public Chaîne
CLASSEMENT MOYEN
CONTRIBUTIONS
0 Point fort
NOMBRE MOYEN DE LIKES
Feeds
Réponse apportée
Write a function max_sum that takes v a row vector of numbers & n,a positive integer as inputs.The function needs to find n consecutive elements of v whose sum is largest possible.It returns summa & index of first element of n consecutive integers.
function [summa,index] = max_sum(v, n) b = zeros(1,n); a = find(v == max(v)); for ii = 1:n b(ii) = max(max(v)); ...
Write a function max_sum that takes v a row vector of numbers & n,a positive integer as inputs.The function needs to find n consecutive elements of v whose sum is largest possible.It returns summa & index of first element of n consecutive integers.
function [summa,index] = max_sum(v, n) b = zeros(1,n); a = find(v == max(v)); for ii = 1:n b(ii) = max(max(v)); ...
environ 3 ans il y a | 0
