Question: Java) The selection-sort program repeatedly finds the smallest number in the current array and swaps it with the first. Rewrite this program by finding the
Java) The selection-sort program repeatedly finds the smallest number in the current array and swaps it with the first. Rewrite this program by finding the largest number and swapping it with the last. Write a test program that reads in 10 double numbers, invokes the method and displays the sorted numbers. The output should look like this:
The numbers before they are sorted are: 12.3 52.1 63.0 42.0 95.1 78.2 12.4 7.0 12.5 10.8
The numbers after they are sorted are: 7.0 10.8 12.3 12.4 12.5 42.0 52.1 63.0 78.2 95.1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
