MICHAEL
Nalanda College of Engineering
Followers: 0 Following: 0
Statistiques
0 Questions
1 Réponse
RANG
174 450
of 300 853
RÉPUTATION
0
CONTRIBUTIONS
0 Questions
1 Réponse
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
0
RANG
of 21 094
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 171 319
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 [s,i] = max_sum(v,n) s = 0; i = 0; len = length(v); l = len-n+1; if n>len s = 0; i = -1; else for ...
plus de 5 ans il y a | 0
