Statistiques
5 Questions
0 Réponses
RANG
124 559
of 300 756
RÉPUTATION
0
CONTRIBUTIONS
5 Questions
0 Réponses
ACCEPTATION DE VOS RÉPONSES
40.0%
VOTES REÇUS
0
RANG
of 21 077
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 170 890
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
Question
Add code to have switch repeat if a case is not met
fprintf('Difficulty level: \nEasy: [0, 10] \nMedium: [0, 50] \nHard: [0, 100] \n'); % Print statement outputting different diffi...
plus de 3 ans il y a | 3 réponses | 0
3
réponsesQuestion
How to eliminate the for loop but end with the same result
A = input('Using brackets, enter a vector: ') for i=1:length(A) if(A(i) > 0) B(i) = A(i).^3; else ...
plus de 3 ans il y a | 1 réponse | 0
1
réponseQuestion
How do I rewrite this code to output the same answer without the for loops
A = [1 3 5 7 9]; B = [2 4 6 8 10]; L = min([length(A) length(B)]); C = zeros(1, 2*L); for i=1:L C(2*(i-1)+1) = A(i); C(2*i...
plus de 3 ans il y a | 1 réponse | 0
1
réponseQuestion
Building a function that calls on an array and finds its maximum
Can somebody help/ give me an example of a function that would find the maximum of an array. Any help would be appreciated.
environ 5 ans il y a | 1 réponse | 0
0
réponseQuestion
Bisection method help.
function [f] = Bisection(a, b, Nmax, TOL); f=@(x) x.*x.*x.-2; i=1; BisectA = f(a) while i <= Nmax p=a+(b-a)/2; ...
environ 5 ans il y a | 1 réponse | 0
