Question

(a) (7 pts) Starting from the insertion sort pseudocode discussed in class, write the pseudocode for an algorithm called REVERSE-INSERTION-SORT(A) which uses the same sorting strategy as the insertion sort algorithm, with the difference that it traverses the array from the end to the beginning, and the sequence of sorted numbers builds at the end of the array. Use the same index variables j and i as in the insertion sort algorithm, where index j is used in a "for" loop to traverse the array from the end to the beginning, and index i is used in the nested "while" loop. The end result is the same, e.g. the numbers will be sorted in increasing order. (b) (4 pts) State the Loop Invariant for the REVERSE-INSERTION-SORT(A) algorithm that you designed in part (a). Let A = < 13, 15, 8, 4, 10, 2, 15, 9, 14, 6> and consider your REVERSE-INSERTION-SORT(A) algorithm when answering (c) and (d): (c) (5 pts) write the array A at the start of the iteration j = 5 of the "for" loop. (d) (3 pts) what is the value of i at the start of the iteration j = 6 of the "for" loop?

          (a) (7 pts) Starting from the insertion sort pseudocode discussed in class, write the pseudocode for an
algorithm called REVERSE-INSERTION-SORT(A) which uses the same sorting strategy as the
insertion sort algorithm, with the difference that it traverses the array from the end to the beginning,
and the sequence of sorted numbers builds at the end of the array. Use the same index variables j and i
as in the insertion sort algorithm, where index j is used in a "for" loop to traverse the array from the
end to the beginning, and index i is used in the nested "while" loop. The end result is the same, e.g. the
numbers will be sorted in increasing order.
(b) (4 pts) State the Loop Invariant for the REVERSE-INSERTION-SORT(A) algorithm that you
designed in part (a).
Let A = < 13, 15, 8, 4, 10, 2, 15, 9, 14, 6> and consider your REVERSE-INSERTION-SORT(A) algorithm
when answering (c) and (d):
(c) (5 pts) write the array A at the start of the iteration j = 5 of the "for" loop.
(d) (3 pts) what is the value of i at the start of the iteration j = 6 of the "for" loop?

(a) (7 pts) Starting from the insertion sort pseudocode discussed in class, write the pseudocode for an
algorithm called REVERSE-INSERTION-SORT(A) which uses the same sorting strategy as the
insertion sort algorithm, with the difference that it traverses the array from the end to the beginning,
and the sequence of sorted numbers builds at the end of the array. Use the same index variables j and i
as in the insertion sort algorithm, where index j is used in a "for" loop to traverse the array from the
end to the beginning, and index i is used in the nested "while" loop. The end result is the same, e.g. the
numbers will be sorted in increasing order.
(b) (4 pts) State the Loop Invariant for the REVERSE-INSERTION-SORT(A) algorithm that you
designed in part (a).
Let A = < 13, 15, 8, 4, 10, 2, 15, 9, 14, 6> and consider your REVERSE-INSERTION-SORT(A) algorithm
when answering (c) and (d):
(c) (5 pts) write the array A at the start of the iteration j = 5 of the "for" loop.
(d) (3 pts) what is the value of i at the start of the iteration j = 6 of the "for" loop?

Added by James W.

Question

Please give Ace some feedback