Descending selection sort with output during execution Write a void method selection SortDescend Trace() that takes an integer array, and sorts the array into descending order. The method should use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is the size). Complete the main() to read in a list of up to 10 positive integers (ending in -1) and then call the selection SortDescendTrace() method. If the input is: 20 10 30 40 -1 then the output is: 40 10 30 20 40 30 10 20 40 30 20 10 LAB ACTIVITY 7.10.1: LAB: Descending selection sort with output during execution 0/10 DescendingOrder. java

import java. util. Scanner;

public class DescendingOrder {
// TODO: Write a void method () that takes
// an integer array and the number of elements in the array as arguments,
// and sorts the array into descending order.
public static void (int [] numbers, int numElements) {

}

public static void main(String[] args) {
Scanner scnr = new Scanner(System. in);

int input, i = 0;
int numElements = 0;
int [] numbers = new int[10];

// TODO: Read in a list of up to 10 positive integers; stop when
// -1 is read. Then call () method.

}
}

import java.util.Arrays; import java.util.Scanner; public class DescendingOrder {    // TODO: Write a void method () that takes // an integer array and the number of elements in the array as arguments, // and sorts the array into descending order.    public static void (int [] numbers, int numElements) {        for(int i = 0; i < numbers.length-1; i++){            int currentMax = numbers[i];            int index = i;            for(int j = i + 1; j < numbers.length; j++){                if(numbers[j] > currentMax){                    currentMax = numbers[j];                    index = j;                }            }            int temp = numbers[i];            numbers[i] = numbers[index];            numbers[index] = temp;            System.out.println(Arrays.toString(numbers));        }    }    public static void main(String[] args) {        Scanner scnr = new Scanner(System.in);        int input, i = 0;        int numElements = 0;        int [] numbers = new int[10]; // TODO: Read in a list of up to 10 positive integers; stop when // -1 is read. Then call () method.        do{            input = scnr.nextInt();            if(input != -1){                numbers[i] = input;                i++;                numElements++;            }        }while(input != -1);        (numbers, numElements);    } }

Explanation:

Firstly, create a do while loop to repeatedly to prompt user for number (Line 38 - 46).

Next, proceed to work on method. Create a nested loop to implement selection sort logic. In outer loop, create variable currentMax and index, to track the maximum number and position of the maximum number for each iteration (Line 11 - 12). In inner loop, a current element value from array will be checked against the subsequent elements in array to identify the maximum value of that iteration (Line 13 - 17). Upon exist from the inner loop, the currentMax is swapped with the current array element indexed by i (Line 20 -21).

Print the array to console for every outer loop iteration (Line 24).

These are very for instance for math pemdas parenthesis, exponents, multiplication, division, addition, subtraction without that i would never be able to remember what to do first with it i can remember.

Apresentation program is a software package used to display information in the form of a slide show. it has three major functions: an editor that allows text to be inserted and formatted, a method for inserting and manipulating graphic images, and a slide-show system to display the content.