Question: 2. Consider the following algorithm. ALGORITHM Secret(A[0n-1]) //Input: An array A[O..n - 1] of n real numbers minval !A[O]; maxval !A[O] for i !1to n-
2. Consider the following algorithm. ALGORITHM Secret(A[0n-1]) //Input: An array A[O..n - 1] of n real numbers minval !A[O]; maxval !A[O] for i !1to 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?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
