Question: 6. Consider the following algorithm and answer the questions. (10%) ALGORITHM X(A0..n-11) // Input: A contains n real numbers for it to n-2 do for

6. Consider the following algorithm and answer the questions. (10%) ALGORITHM X(A0..n-11) // Input: A contains n real numbers for it to n-2 do for j i +1 to n - 1 do if A[j] > A[i] swap A[i] and A[] 1. What does this algorithm compute? 2. What is the basic operation? 3. How many times is the basic operation executed? 4. 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
