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

//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] > maxval

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

//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] > maxval

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

### Recently Asked Questions

- 217 . The company 's negotiation starting position for wages

- Refer to the table . Based on all this information , what is the total utility that the typical student gets at equilibrium ?

- Use the following table for a certain product 's market in Econland to answer the next question . Quantity Demanded Domestically Price Quantity Supplied