Consider the following algorithm:

Algorithm Secret(A[0..n 1])

//Input: An array A[0..n 1] of n real numbers

minvalA[0]

maxvalA[0]

for i 1 to n 1 do

if A[i]< minval

minvalA[i]

if A[i]> maxval

maxvalA[i]

return maxval minval

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 altogether, and indicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.

b. Is this algorithm stable?