My issue:I wrote my questions in bold in the comments of the codeJava code: import java.util.Scanner;public class DescendingOrder {// TODO: Write a void method selectionSortDescendTrace() 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 selectionSortDescendTrace(int [] numbers, int numElements) {//my code starts hereint i; int j;int elementIndex; int temp; //loop in ascending order using textbook examplefor (i=0; i < numElements-1; ++i) {index=i; for (j=i+1; j < numElements; ++j) {if (numbers[j] < numbers[elementIndex]) {elementIndex=j; }}//swap using textbook exampletemp=numbers[i];numbers[i]=numbers[elementIndex];numbers[elementIndex]=temp;//I don't know how to put it in descending order. Is it using a loop?//where do I put in descending order? Is it in the method definitions or main method ??? } }//my code ends herepublic 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 selectionSortDescendTrace() method.//my code starts herefor (i=0; i < numbers.length; ++i) {input=scnr.nextInt();numbers[i]=input; if (numbers[i]==-1) {break;numElements++; }//selectionSortDescendTrace(); //what goes inside the parenthesis???//my code ends here}} 8.10 LAB: Descending selection sort with output during executionWrite a void method selectionSortDescendTrace() that takes an integer array, and sorts the array into descending order. The methodshould use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is thesize). Complete main() to read in a list of up to 10 positive integers (ending in -1) and then call the selectionSortDescendTrace() method.If the input is:20 10 30 40 -1then the output is:40 10 30 2040 30 10 2040 30 20 10 Selection sort has the advantage of being easy to code, involving one loop nested within another loop, as shown below.Figure 8.6.1: Selection sort algorithm.public class SelectionSort {public static void selectionSort (int [] numbers) {int i;int j;int indexSmallest;int temp;// Temporary variable for swapfor (i = e; i« numbers.length1; ++i) {// Find index of smallest remaining elementindexSmallest = i;for (j = i + 1; j< numbers.length; ++j) {if (numbers[j] < numbers [indexSmallest]) {indexSmallest - j;}// Swap numbers[i] and numbers[indexSmallest]temp = numbers[i];numbers[i] = numbers[indexSmallest];numbers[indexSmallest] = temp;UNSORTED: 10 2 78 4 45 32 7 11SORTED: 2 4 7 10 11 32 45 78public static void main(String [] args)int numbers [] = {10, 2, 78, 4, 45, 32, 7, 11};int i;System.out.print ("UNSORTED: ");for (i = e; i < numbers.length; ++i)System.out.print (numbers[i] +System.outIn()3B/* initial call to selection sort with index */selectionSort(numbers);System.out.print("SORTED: ");for (i = e; i < numbers.length; ++i) {System.out.print (numbers[i] + " ");System.out.println();Feedback?Selection sort may require a large number of comparisons. The selection sort algorithm runtime is O(N2). If a list has N elements, the outerloop executes N -1 times. For each of those N -1 outer loop executions, the inner loop executes an average of * times. So the total

Your 1st question is how to print in descending order and for that what should I change: The answer…

My issue: I wrote my questions in bold in the comments of the code Java code: import java.util.Scanner; public class DescendingOrder { // TODO: Write a void method selectionSortDescendTrace() 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 selectionSortDescendTrace(int [] numbers, int numElements) { //my code starts here int i; int j; int elementIndex; int temp; //loop in ascending order using textbook example for (i=0; i < numElements-1; ++i) { index=i; for (j=i+1; j < numElements; ++j) { if (numbers[j] < numbers[elementIndex]) { elementIndex=j; } } //swap using textbook example temp=numbers[i]; numbers[i]=numbers[elementIndex]; numbers[elementIndex]=temp; //I don't know how to put it in descending order. Is it using a loop? //where do I put in descending order? Is it in the method definitions or main method ??? } } //my code ends here 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 selectionSortDescendTrace() method. //my code starts here for (i=0; i < numbers.length; ++i) { input=scnr.nextInt(); numbers[i]=input; if (numbers[i]==-1) { break; numElements++; } //selectionSortDescendTrace(); //what goes inside the parenthesis??? //my code ends here } }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

My issue:

I wrote my questions in bold in the comments of the code

Java code:

import java.util.Scanner;

public class DescendingOrder {
// TODO: Write a void method selectionSortDescendTrace() 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 selectionSortDescendTrace(int [] numbers, int numElements) {
//my code starts here
int i;
int j;
int elementIndex;
int temp;
//loop in ascending order using textbook example
for (i=0; i < numElements-1; ++i) {
index=i;
for (j=i+1; j < numElements; ++j) {
if (numbers[j] < numbers[elementIndex]) {
elementIndex=j;
}
}
//swap using textbook example
temp=numbers[i];
numbers[i]=numbers[elementIndex];
numbers[elementIndex]=temp;

//I don't know how to put it in descending order. Is it using a loop?
//where do I put in descending order? Is it in the method definitions or main method ???
}
}
//my code ends here

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 selectionSortDescendTrace() method.

//my code starts here

for (i=0; i < numbers.length; ++i) {
input=scnr.nextInt();
numbers[i]=input;
if (numbers[i]==-1) {
break;
numElements++;
}
//selectionSortDescendTrace(); //what goes inside the parenthesis???

//my code ends here

}
}

8.10 LAB: Descending selection sort with output during execution
Write a void method selectionSortDescendTrace() 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 main() to read in a list of up to 10 positive integers (ending in -1) and then call the selectionSortDescendTrace() 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

Selection sort has the advantage of being easy to code, involving one loop nested within another loop, as shown below.
Figure 8.6.1: Selection sort algorithm.
public class SelectionSort {
public static void selectionSort (int [] numbers) {
int i;
int j;
int indexSmallest;
int temp;
// Temporary variable for swap
for (i = e; i« numbers.length
1; ++i) {
// Find index of smallest remaining element
indexSmallest = i;
for (j = i + 1; j< numbers.length; ++j) {
if (numbers[j] < numbers [indexSmallest]) {
indexSmallest - j;
}
// Swap numbers[i] and numbers[indexSmallest]
temp = numbers[i];
numbers[i] = numbers[indexSmallest];
numbers[indexSmallest] = temp;
UNSORTED: 10 2 78 4 45 32 7 11
SORTED: 2 4 7 10 11 32 45 78
public static void main(String [] args)
int numbers [] = {10, 2, 78, 4, 45, 32, 7, 11};
int i;
System.out.print ("UNSORTED: ");
for (i = e; i < numbers.length; ++i)
System.out.print (numbers[i] +
System.out
In()3B
/* initial call to selection sort with index */
selectionSort(numbers);
System.out.print("SORTED: ");
for (i = e; i < numbers.length; ++i) {
System.out.print (numbers[i] + " ");
System.out.println();
Feedback?
Selection sort may require a large number of comparisons. The selection sort algorithm runtime is O(N2). If a list has N elements, the outer
loop executes N -1 times. For each of those N -1 outer loop executions, the inner loop executes an average of * times. So the total

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.