Heads up, this is a harder problem. Congratulations on making it here!

Given an input array of ints, swap each of the consecutive elements of the array with the elements one index higher, but only when the earlier value is greater than the later value. Thus, the element at index 0 is (potentially) swapped with the element at index 1, the element with index 1 is (potentially) swapped with the element at index 2, and so on. Return the modified array, or a copy of it with the described modifications.

HINT

Note that this is not a complete sort, it only makes a single pass through the array. The result of this should be that the highest element "moves" to the end of the array.