Statistiques
0 Questions
3 Réponses
RANG
115 803
of 301 078
RÉPUTATION
0
CONTRIBUTIONS
0 Questions
3 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
0
RANG
of 21 165
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 172 702
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(v,n) summa=sum(v(v<0)); for ii=1:(length(v)-(n-1)) t=0; for jj=ii:(...
plus de 5 ans il y a | 0
text file I/O
function charnum = char_counter(fname,character) fid = fopen(fname,'rt'); charnum = 0; if fid < 0 || ~ischar(character) ...
plus de 5 ans il y a | 0
Write a function called get_distance that accepts two character vector inputs representing the names of two cities. The function returns the distance between them as an output argument called distance. For example, the call get_distance('Seattle, WA'
function distance=get_distance(c1,c2) [num txt raw]=xlsread("Distances.xlsx"); a=0;b=0; for ii=2:337 if strcmp(txt{1,ii}...
plus de 5 ans il y a | 0
