Question: Consider the following algorithm and answer the questions. ALGORITHM X(A[0..n 1]) // Input: A contains n real numbers for i 0 to n 2 do
Consider the following algorithm and answer the questions.
ALGORITHM X(A[0..n 1]) // Input: A contains n real numbers
for i 0 to n 2 do
for j i + 1 to n 1 do
if A[j] > A[i]
swap A[i] and A[j]
1. What does this algorithm compute?
2. What is the input size?
3. What is the basic operation?
4. How many times is the basic operation executed? (Set up a sum, and simplify the sum, to find the function expressing the number of repetitions of the basic operation.)
5. 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
