Consider the Radix sort algorithm, with the pseudocode below. RADIX-SORT(A.d) fo

Question

Consider the Radix sort algorithm, with the pseudocode below. RADIX-SORT(A.d) for i 1 to d use COUNTING-SORT to sort array A on digit i Which of the following is the correct loop invariant for the for loop? O At the start of each iteration i of the for loop, array A[1..] is sorted in increasing order. O At the start of each iteration i of the for loop, array A[1...i-1] is sorted in increasing order. O At the start of each iteration i of the for loop, array A is sorted on digits 1, 2,. O At the start of each iteration i of the for loop, array A is sorted on digits 1, 2, ., i-1.

Explanation / Answer

Ans:(A)

--> At the start of each iteration i of the loop,Array A[1....i] is sorted in incresing order.

int getMax(int arr[], int n)

{

    int mx = arr[0];

    for (int i = 1; i < n; i++)

        if (arr[i] > mx)

            mx = arr[i];

    return mx;

}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.