Suppose we want to put an array of n integer numbers into descending
numerical order. This task is called sorting. One simple algorithm for sorting
is selection sort. You let an index i go from 0 to n-1, exchanging the ith element of
the array with the maximum element from i up to n. Using this finite set of integers
as the input array {4 3 9 6 1 7 0}:
i. Write a java or C++ code implementing the algorithm. (AP)15 marks
ii. Write or draw all the iterations in the selection sort process on the
array
