Question
Consider the following algorithm. 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
Consider the following algorithm.
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
Answer the below
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.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started