How can i solve this exam practise question
3 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Comfort
el 11 de Jun. de 2020
Comentada: Rena Berman
el 12 de Oct. de 2020
5 comentarios
Rik
el 14 de Jun. de 2020
(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
Respuesta aceptada
Rik
el 11 de Jun. de 2020
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 comentarios
Rik
el 12 de Jun. de 2020
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.
Más respuestas (1)
madhan ravi
el 11 de Jun. de 2020
Editada: madhan ravi
el 11 de Jun. de 2020
doc mink
doc maxk
doc sum
2 comentarios
Rik
el 11 de Jun. de 2020
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.
Ver también
Productos
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!