Bryce McCord

Last seen: 11 days 前 | 自 2020 起处于活动状态

Followers: 0 Following: 0

提问

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...

2 years 前 | 3 个回答 | 0

个回答

提问

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 ...

2 years 前 | 1 个回答 | 0

个回答

提问

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...

2 years 前 | 1 个回答 | 0

个回答

提问

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.

4 years 前 | 0 个回答 | 0

个回答

提问

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; ...

4 years 前 | 1 个回答 | 0

个回答

Thankful Level 2