For a known length and arrange a good array in ascending order, now that the programming to realize the following function, starting from the specified location I n number according to the reverse reordering, and outputs the new array;

CodePudding user response:

Can help me write out the operation result

CodePudding user response:

refer to the original poster m0_54231722 response:

for a known length and arrange a good array in ascending order, now that the programming to realize the following function, starting from the specified location I n number according to the reverse reordering, and outputs the new array;

Help your child a picture of the operation result is come out

CodePudding user response:

#include
#include
#include
using namespace std;

Int main ()
{
Int a [10]=,1,2,3,4,5,6,7,8,9 {0}.
Sort (a + a + 3, sizeof (a)/sizeof (a [0]), greater ());
For (auto & amp; I: a)
Cout & lt; Cout & lt; return 0;
}