C++ - Problem 2: Almost Sort
For this problem, you will again use the swap method you just created and the numbers array. This time you
will create a method called sort that receives the numbers array. You should use a for loop to go through the
entire array using a for loop. Assuming x is the control variable you should compare the value at index x and at
x+1. If the value at x is greater than the value of x+1 then you should call the swap method passing the array
and x and x+1 so that the values are reversed.
After the function call in main, output all the values of the numbers array on a single line separated by a space.
A sample of the original array values and the array values after the function runs are shown below.
21 45 78 36 11 62 19 24 93 48 //Original order of the values of the array.
21 45 36 11 62 19 24 78 48 93 //New order of the array values after the sort function runs.

C++ -

Problem 2: Almost Sort

For this problem, you will again use the swap method you just created and the numbers array. This time you

will create a method called sort that receives the numbers array. You should use a for loop to go through the

entire array using a for loop. Assuming x is the control variable you should compare the value at index x and at

x+1. If the value at x is greater than the value of x+1 then you should call the swap method passing the array

and x and x+1 so that the values are reversed.

After the function call in main, output all the values of the numbers array on a single line separated by a space.

A sample of the original array values and the array values after the function runs are shown below.

21 45 78 36 11 62 19 24 93 48 //Original order of the values of the array.

21 45 36 11 62 19 24 78 48 93 //New order of the array values after the sort function runs.

Explanation:

please mark as brainlist if not

please don't delete or report my answer.

chapters are in the book (this fleeting world)

explanation: