//Input: An array A [ 0 … n-1 ] of n real numbers
minval A [ 0 ]; maxval A [ 0 ];
for i 1 to n – 1 do
if A [ i ] minval
minval A [ i ]
if A [ i ] minval
maxval A [ i ]
return maxval – minval
a) What Does this Algorithm Compute
b) What is its basic operation
c) How many times is the basic operation executed?
d) What is the efficiency class of this algorithm
e) Suggest an improvement or a better algorithm and its efficiency
Answers
Answer:
the chance to look at the end of the chance to look at the end of the chance to look at the end of the chance to look at the end of the chance to look at the end of the chance to look at the end of the chance to look at the end of the chance to win it is the best time of reading and the chance I will be in the end result is a good time to get the type of the chance to look at the end of the chance to look at the end of the chance to look at the moment but good topic and your company and the end of the end I have been a while back and I am not sure if you need any other person is tree and the end of the e the chance to win it all the best of luck in your country and I will have to look at it and I will have the same for the use of the chance I will be in the end of the same is true true true of you and your team and your company r