Statistiques
0 Questions
2 Réponses
RANG
6 906
of 300 886
RÉPUTATION
6
CONTRIBUTIONS
0 Questions
2 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
2
RANG
of 21 104
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 171 502
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 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.
This is my answer function [summa,index] = max_sum(v,n) b=1; summa = -1000000; %i start it with -1000000 because you ALWAYS ...
plus de 4 ans il y a | 0
next prime number using While loops
You just want the next prime so you can just do function k = next_prime(n) k = n + 1 % now k = input + 1 while isprime(k) =...
plus de 4 ans il y a | 2
