3. The following algorithm sorts the numbers in the array from smallest to largest. How can...

Transcribed Image Text:

3. The following algorithm sorts the numbers in the array from smallest to largest. How can you modify it so the sorting is now done from largest to smallest? Please, do your own modification first (even better, code it!) and then, look at the possible answers. A: array of numbers N: number of elements in array A 1 2 3 4 5 6 7 8 9 10 11 12 13 14 function Sort (A, N) swapped=true while (swapped) swapped=false for 0 < i < N-1 if (A[i]> A[i+1]) then end end for N=N-1 end while return A end function swap(A[i], A[i+1]) swapped=true if none of the others the instruction swap (A[i], A[i+1]) must be changed to swap(A[i+1], A[i]) the instruction swapped=true must be changed to swapped-false and vice versa the specification of the for loop in line 5 must be changed to: for N-1<i<= 0 do the condition A[i] > A[i+1] in line 6 must be changed to A[i] <A[i+1] 3. The following algorithm sorts the numbers in the array from smallest to largest. How can you modify it so the sorting is now done from largest to smallest? Please, do your own modification first (even better, code it!) and then, look at the possible answers. A: array of numbers N: number of elements in array A 1 2 3 4 5 6 7 8 9 10 11 12 13 14 function Sort (A, N) swapped=true while (swapped) swapped=false for 0 < i < N-1 if (A[i]> A[i+1]) then end end for N=N-1 end while return A end function swap(A[i], A[i+1]) swapped=true if none of the others the instruction swap (A[i], A[i+1]) must be changed to swap(A[i+1], A[i]) the instruction swapped=true must be changed to swapped-false and vice versa the specification of the for loop in line 5 must be changed to: for N-1<i<= 0 do the condition A[i] > A[i+1] in line 6 must be changed to A[i] <A[i+1]

Answer rating: 100% (QA)

The given code appears to be implementing a bubble sort algorithm to sort an array A of N numbers ... View the full answer