How can i solve this exam practise question
5 次查看(过去 30 天)
显示 更早的评论
5 个评论
Rik
2020-6-14
(original question and comments by Comfort Chauke (the name of OP before it was changed to Wilson) recovered from Google cache)
Comfort Chauke on 11 Jun 2020 at 9:39:
How can i solve this exam practise question
Comfort Chauke on 11 Jun 2020 at 10:33:
function [minsum, maxsum]=MyFunction(L)
sum=0;
for i=1:length (L)
sum=sum+L(i);
end
min=L(1);
max=L(1);
for i=1:length (L)
if L(i)<min
min=L(i);
end
if L(i)>max
max=L(i);
end
end
minsum=sum-max
maxsum=sum-min
Comfort Chauke on 11 Jun 2020 at 12:03:
That's my problem i don't know how make calculate the minimum and maximum values that can be obtained from adding K elements
采纳的回答
Rik
2020-6-11
Since you aren't allowed to use efficient tools (e.g. sort), you are forced to write slow code. I would not try to use eval to cheat here, although I doubt the grader will detect that, especially if you encapsulate it in str2func.
BUT: you are in luck. You were given the task to get the numbers without repitition. The unique function will automatically sort the output for you.
16 个评论
Rik
2020-6-12
You're welcome. If you feel I have solved your question, please consider marking my answer as accepted answer. If not, feel free to comment with your remaining issues.
更多回答(1 个)
madhan ravi
2020-6-11
编辑:madhan ravi
2020-6-11
doc mink
doc maxk
doc sum
2 个评论
Rik
2020-6-11
Since this question is supposed to be run in Octave, the students are forced to use other functions, since mink and maxk were introduced in R2017b, but aren't implemented in Octave.
另请参阅
产品
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!