Notes on the C ++ standard library generic algorithm reverse

In C ++ primer, the reverse elements of reverse are described as follows:

A container is, and after sort.

A container is, and later is.

Assume that a container is,. Why do you think reverse will be used? No error, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0.

But what about a container which is, 8? Is it 9, 8, 7, 6, 5, 4, 3, 2? Aren't they sorted in descending order?

This is what I used to understand. However, only in actual use can we know that reverse is sorted from time to time.AlgorithmOnly reverse sorting. 9, 8, 7, 6, 5, 4, 3, 2, 1, 0

After the reverse is changed to 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. To get the descending order method, it seems that you can first sort and then reverse. I don't know if I'm right.

VerificationCodeIt is very simple.