STL中最常用的函数之一，排序的神器。
sort
1 2 3 4 5 6 

function
Sort elements in range Sorts the elements in the range first,last) into ascending order.
The elements are compared using operator< for the first version, and comp for the second.
Elements that would compare equal to each other are not guaranteed to keep their original relative order.
Parameters
first, last RandomAccess iterators to the initial and final positions of the sequence to be sorted. The range used is first,last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last. comp Comparison function object that, taking two values of the same type than those contained in the range, returns true if the first argument goes before the second argument in the specific strict weak ordering it defines, and false otherwise.
Return value
none
Example
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 

Output:
myvector contains: 12 26 32 33 45 53 71 80
Complexity
Approximately NlogN comparisons on average (where N is lastfirst). In the worst case, up to N2, depending on specific sorting algorithm used by library implementation.