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?

Algorithm Secret(A[0..n − 1]) //Input: An array A[0..n − 1] of n r

1.	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?
Answer» KNOW fztidizdfyfsexy coditdtodfiidtdt