Write a void function SelectionSortDescendTrace() that takes an integer array and sorts the array into descending order. The function 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() function.
In c++, please! Thank you!
Write a void function SelectionSortDescendTrace() that takes an integer array and sorts the array into descending order. The function 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() function.
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
The following code is given:
#include <iostream>
using namespace std;
// TODO: Write a void function SelectionSortDescendTrace() that takes
// an integer array and the number of elements in the array as arguments,
// and sorts the array into descending order.
void SelectionSortDescendTrace(int numbers [], int numElements) {
}
int main() {
int input, i = 0;
int numElements = 0;
int numbers [10];
// TODO: Read in a list of up to 10 positive integers; stop when
// -1 is read. Then call SelectionSortDescendTrace() function.
return 0;
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
