Statistica
All
RANK
10.534
of 301.537
REPUTAZIONE
4
CONTRIBUTI
0 Domande
2 Risposte
ACCETTAZIONE DELLE RISPOSTE
0.00%
VOTI RICEVUTI
2
CONTRIBUTI
0 Post
CONTRIBUTI
0 Pubblico Canali
VALUTAZIONE MEDIA
CONTRIBUTI
0 Punti principali
NUMERO MEDIO DI LIKE
Feeds
Risposto
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 ...
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 ...
circa 6 anni fa | 2
Risposto
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 sum = halfsum(a) sum = 0; [row,col] = size(a); for i=1:row for j=1:col if i<=j ...
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 sum = halfsum(a) sum = 0; [row,col] = size(a); for i=1:row for j=1:col if i<=j ...
circa 6 anni fa | 0
